Question: 
Write a python function to find the sum of hamming distances of all consecutive numbers from o to n.


Model's Code:
def Total_Hamming_Distance(n):
    total_distance = 0
    for i in range(n):
        total_distance += bin(i ^ (i + 1)).count('1')
    return total_distance



Sample Correct Code:
def Total_Hamming_Distance(n):   
    i = 1
    sum = 0
    while (n // i > 0):  
        sum = sum + n // i  
        i = i * 2     
    return sum


Asserts:
assert Total_Hamming_Distance(4) == 7
assert Total_Hamming_Distance(2) == 3
assert Total_Hamming_Distance(5) == 8


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 547 of 974: 403/547 (73.6745886654479%): success