You are given a $0$ indexed integer array nums. In a single operation, you may select any non negative integer x and an index i, and update nums[i] to nums[i] AND (nums[i] XOR x).

You may perform this operation any number of times on any indices.

Return the maximum possible bitwise XOR sum of all elements in nums after applying the operation any number of times.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.