Sum of ones

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;


void countTotalOnes(int num) {
    long long sum = 0;
    long long mod = 2;
    while (true) {
        long long divnum = num / mod;
        long long modnum = num % mod;
        sum += divnum * (mod / 2);
        if (modnum >= mod / 2) sum += modnum - (mod / 2) + 1;
        if(mod > num) break;
        mod *= 2;

    }
    cout << sum << endl;
}



int main() {
    long long n;
    cin >> n;

    /*for(int i = 0; i < k; i++){
        int a;
        cin >> a;
    }*/

    countTotalOnes(n);

    


}

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: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER