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 17, 2026 03:26Andrew EpsteinAndrew EpsteinScore: 100,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:2799,247834,013,751822,751,0001,002,0002,117,632stderr
2Sep 17, 2026 03:2799,395835,392,566823,982,0001,002,0002,117,632stderr
3Sep 17, 2026 03:2799,493835,973,208824,795,0001,005,0002,117,632stderr
4Sep 17, 2026 03:2799,868839,183,513827,891,0001,017,0002,117,632stderr
5Sep 17, 2026 03:27100,049840,663,397829,405,0001,008,0002,117,632stderr
6Sep 17, 2026 03:27100,089841,042,009829,740,0001,001,0002,117,632stderr
7Sep 17, 2026 03:27100,104841,134,633829,851,0001,013,0002,117,632stderr
8Sep 17, 2026 03:27100,220842,117,825830,832,0001,002,0002,117,632stderr
9Sep 17, 2026 03:27100,422843,796,546832,503,0001,001,0002,117,632stderr