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 listSep 14, 2026 04:07Victor MerckléVictor MerckléScore: 5,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 04:084,98851,349,80640,280,0001,127,0002,117,632stderr
2Sep 14, 2026 04:084,99051,245,30340,301,0001,119,0002,117,632stderr
3Sep 14, 2026 04:084,99551,913,00840,343,0001,116,0002,117,632stderr
4Sep 14, 2026 04:084,99951,350,23840,363,0001,131,0002,117,632stderr
5Sep 14, 2026 04:085,06351,866,57040,911,0001,119,0002,117,632stderr
6Sep 14, 2026 04:085,07852,598,72941,036,0001,113,0002,117,632stderr
7Sep 14, 2026 04:085,08452,227,49341,082,0001,117,0002,117,632stderr
8Sep 14, 2026 04:085,08752,618,40641,122,0001,108,0002,117,632stderr
9Sep 14, 2026 04:085,10452,776,16441,254,0001,111,0002,117,632stderr