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 02:43Andrew EpsteinAndrew EpsteinScore: 5,020Success
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 02:444,99651,777,61739,404,0002,069,0002,121,728stderr
2Sep 17, 2026 02:445,00952,821,67439,486,0002,092,0002,121,728stderr
3Sep 17, 2026 02:445,01151,970,00439,531,0002,067,0002,121,728stderr
4Sep 17, 2026 02:445,01251,944,02639,505,0002,095,0002,121,728stderr
5Sep 17, 2026 02:445,02052,031,44339,575,0002,092,0002,121,728stderr
6Sep 17, 2026 02:445,07061,978,57139,950,0002,138,0002,121,728stderr
7Sep 17, 2026 02:445,07152,524,70439,998,0002,096,0002,121,728stderr
8Sep 17, 2026 02:445,15153,828,86340,654,0002,102,0002,121,728stderr
9Sep 17, 2026 02:445,27964,522,31541,698,0002,121,0002,117,632stderr