Total Hamming Distance Python Solution

lcpy gen -n 477   # by problem number
lcpy gen -s total_hamming_distance   # by problem name

Input: nums = [4,14,2]
Output: 6
Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
showing the four bits relevant in this case).
The answer will be:
HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.

Input: nums = [4,14,4]
Output: 4

class Solution:
    # Time: O(n * b) where b is the number of bits (32)
    # Space: O(1)
    def total_hamming_distance(self, nums: list[int]) -> int:
        total = 0
        for bit in range(32):
            ones = sum((num >> bit) & 1 for num in nums)
            total += ones * (len(nums) - ones)
        return total