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 15, 2026 22:31Victor MerckléVictor MerckléScore: 6,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 22:316,96567,679,21056,803,0001,010,0002,113,536
2May 15, 2026 22:316,96765,160,08956,826,0001,002,0002,113,536
3May 15, 2026 22:316,97066,885,39356,847,0001,011,0002,113,536
4May 15, 2026 22:316,97165,155,35256,850,0001,017,0002,113,536
5May 15, 2026 22:316,97668,238,69456,887,0001,016,0002,113,536
6May 15, 2026 22:316,97667,377,21556,897,0001,004,0002,113,536
7May 15, 2026 22:317,02467,819,47257,277,0001,026,0002,113,536
8May 15, 2026 22:317,02566,622,56157,291,0001,020,0002,113,536
9May 15, 2026 22:317,10366,263,86757,938,0001,017,0002,113,536