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 listMay 10, 2026 15:44Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 15:45040,703,20432,450,0001,050,0002,113,536expected "53684353637744382 ", got "53684355117524512 "
2May 10, 2026 15:454,00741,968,99932,212,0001,048,0002,113,536
3May 10, 2026 15:454,01143,515,81832,236,0001,060,0002,113,536
4May 10, 2026 15:454,01541,237,88232,267,0001,061,0002,113,536
5May 10, 2026 15:454,01940,962,27032,306,0001,056,0002,113,536
6May 10, 2026 15:454,03442,915,86132,337,0001,150,0002,113,536
7May 10, 2026 15:454,04642,745,54632,559,0001,026,0002,113,536
8May 10, 2026 15:454,05540,850,42832,602,0001,058,0002,113,536
9May 10, 2026 15:454,14443,953,60233,346,0001,053,0002,113,536