猎奇民间数据，这做法能过

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=5e5+10;
int n,k;
ll ans;
int a[MAXN];
int q[MAXN];
inline int read(){
	int x=0;bool f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=0;
		c=getchar();
	} 
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
	return f?x:-x;
}
int main(){	
	n=read(),k=read();
	for(int i=1;i<=n;i++){
		a[i]=read();
		q[i]=a[i]^q[i-1];
	//	cout<<q[i]<<' ';
	}
	int lt=1;
	for(int j=1;j<=n;j++){
		for(int i=lt;i<=j;i++){
			if((q[j]^q[i-1])==k){
				ans++;
				lt=j+1;
				break;
			}
		}
	}
	printf("%lld",ans);
	return 0;
}