Sum of ones

def sumof(n):
    sums = []
    for i in range(1,n+1):
        x = str(bin(i))[2:]
        bitsum = sum(list(map(int, list(x))))
        sums.append(bitsum)
    return sum(sums)




if __name__ == "__main__":
    n = int(input())
    res = sumof(n)
    print(res)

"""
Input:
7

Output:
12

Explanation: The binary representations of 1... 7 are: 
1, 10, 11, 100, 101, 110, and 111, so there are a total of 12 one bits.
"""

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: TIME LIMIT EXCEEDED

Test 21

Verdict: TIME LIMIT EXCEEDED