Given an integer array nums, calculate the total Hamming distance between every pair of distinct elements.

The Hamming distance between two integers is the number of bit positions at which their binary representations differ.

Return the sum of the Hamming distances for all unordered pairs of elements in nums.

Constraints:

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

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

• The result fits in a $32$ bit integer.

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.