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 01:11Andrew EpsteinAndrew EpsteinScore: 5,080Success
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 01:115,03952,171,70839,657,0002,167,0002,121,728stderr
2Sep 17, 2026 01:115,04052,157,60039,579,0002,255,0002,121,728stderr
3Sep 17, 2026 01:115,06252,301,06639,762,0002,253,0002,121,728stderr
4Sep 17, 2026 01:115,07252,479,33039,936,0002,163,0002,121,728stderr
5Sep 17, 2026 01:115,08052,530,92640,001,0002,164,0002,121,728stderr
6Sep 17, 2026 01:115,08652,564,24739,953,0002,261,0002,121,728stderr
7Sep 17, 2026 01:115,08752,612,38639,929,0002,296,0002,121,728stderr
8Sep 17, 2026 01:115,09752,670,94840,024,0002,285,0002,121,728stderr
9Sep 17, 2026 01:115,24755,266,59641,483,0002,071,0002,121,728stderr