Maximum XOR of a Subset — Solution & Editorial
Build a linear basis over GF(2) by Gaussian elimination on the bits; then greedily XOR in each basis vector from the highest bit if it increases the result.
Complexity: O(N · 60)
Build a linear basis over GF(2) by Gaussian elimination on the bits; then greedily XOR in each basis vector from the highest bit if it increases the result.
Complexity: O(N · 60)