Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 6, 2026 03:00CheckHarryCheckHarryScore: 3,984Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:013,95242,818,12431,797,0001,010,0002,113,536
2Sep 6, 2026 03:013,95742,691,01731,840,0001,009,0002,113,536
3Sep 6, 2026 03:013,96042,793,58931,819,0001,053,0002,113,536
4Sep 6, 2026 03:013,97042,860,65731,932,0001,026,0002,113,536
5Sep 6, 2026 03:013,98443,036,53832,029,0001,043,0002,113,536
6Sep 6, 2026 03:014,06843,711,81432,762,0001,010,0002,113,536
7Sep 6, 2026 03:014,07743,681,97332,831,0001,010,0002,113,536
8Sep 6, 2026 03:014,18844,660,87833,756,0001,011,0002,113,536
9Sep 6, 2026 03:014,23145,069,27534,102,0001,022,0002,113,536