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 12, 2026 10:10Victor MerckléVictor MerckléScore: 10,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 10:1010,09794,176,03582,716,0001,096,0002,113,536
2May 12, 2026 10:1010,10295,540,70782,727,0001,127,0002,113,536
3May 12, 2026 10:1010,10894,699,82482,739,0001,159,0002,113,536
4May 12, 2026 10:1010,11192,784,64682,752,0001,176,0002,113,536
5May 12, 2026 10:1010,11294,777,43482,752,0001,178,0002,113,536
6May 12, 2026 10:1010,11294,710,98682,752,0001,180,0002,113,536
7May 12, 2026 10:1010,11594,474,23282,776,0001,184,0002,113,536
8May 12, 2026 10:1010,11593,947,48882,784,0001,177,0002,113,536
9May 12, 2026 10:1010,13794,655,68282,964,0001,177,0002,113,536