Maximum XOR of a Subset

Difficulty: 2000 4000 ms 128 MB

bitwise linear-algebra

Choose any subset (including empty) of the N values; print the maximum achievable XOR of the chosen elements.

Input: the first line has N; the second line has N non-negative integers.

Output: the maximum subset XOR.

Constraints:

• 1 ≤ N ≤ 10⁵
• 0 ≤ a_i < 2⁶⁰

Sample Tests

3
1 2 3

3

2
8 8

8

Read the Editorial