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 13, 2026 23:22Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:22071,174,97562,752,00002,113,536expected "53688588186969971 ", got "53688585882969971 "
2May 13, 2026 23:227,55872,047,43662,738,00002,113,536
3May 13, 2026 23:227,55972,036,53862,746,00002,113,536
4May 13, 2026 23:227,56070,655,43362,749,00002,113,536
5May 13, 2026 23:227,56071,717,64762,749,00002,113,536
6May 13, 2026 23:227,56171,603,53662,763,00002,113,536
7May 13, 2026 23:227,56373,373,01061,731,0001,048,0002,113,536
8May 13, 2026 23:227,67872,924,79062,721,0001,008,0002,113,536
9May 13, 2026 23:227,77671,840,69964,546,00002,113,536