Counting ones

#include <iostream>
#include <bitset>
#include <vector>

int main() {
    int n;
    std::cin >> n;
    std::vector<long long unsigned int> input(n);
    for (int i = 0; i < n; i++) {
        std::cin >> input[i];
    }
    const long long length = 1000000000000000000;
    std::bitset<length> ones(1);
    long long unsigned int curr1 = input[0];
    long long unsigned int curr2 = input[1];
    std::bitset<length> mult{curr1*curr2};
    long long max = (mult & ones).count();
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            mult = {input[i] * input[j]};
            long long tmp = (mult & ones).count();
            if (tmp > max) {
                max = tmp;
                curr1 = input[i];
                curr2 = input[j];
            }
        }
    }
    std::cout << max << '\n' << curr1 << ' ' << curr2 << '\n';
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR