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 22, 2026 08:44Victor MerckléVictor MerckléScore: 9,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:458,99283,822,45773,557,0001,081,0002,117,632stderr
2May 22, 2026 08:459,00382,512,50573,635,0001,090,0002,117,632stderr
3May 22, 2026 08:459,02682,690,58473,899,0001,018,0002,117,632stderr
4May 22, 2026 08:459,03282,706,00373,961,0001,009,0002,117,632stderr
5May 22, 2026 08:459,04082,835,80874,006,0001,032,0002,117,632stderr
6May 22, 2026 08:459,26584,685,00775,887,0001,019,0002,117,632stderr
7May 22, 2026 08:459,26686,487,81575,891,0001,025,0002,117,632stderr
8May 22, 2026 08:459,32986,280,09776,420,0001,017,0002,117,632stderr
9May 22, 2026 08:459,59788,107,08378,650,0001,012,0002,117,632stderr