Given three integer arrays a, b, and c, return the number of triplets (i, j, k) such that the bitwise XOR sum a[i] ^ b[j] ^ c[k] contains an even number of set bits in its binary representation.

Constraints:

• $1 \leq$ a.length, b.length, c.length $\leq 10^5$

• $0 \leq$ a[i], b[i], c[i] $\leq 10^9$

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.