Sum of ones

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;

long long largest_power(long long n){
    if (!(n & (n - 1)))
        return n;
    int p = (long long)log2(n);
    return (long long)pow(2, p-1);
}

long long count(long long n){
    
    if (n <= 1)
        return n;

    long long x = largest_power(n);
    return (x * pow(2, (x-1)) + (n- pow(2, x) +1) + count(n - pow(2, x)));
}

int main() {
    long long n;
    cin >> n;
    
    cout << count(n) << endl;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

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