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 25, 2026 20:29Maya RebholzMaya RebholzScore: 6,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:295,86859,833,97343,625,0005,086,0002,117,632
2May 25, 2026 20:295,87459,545,38243,520,0005,239,0002,113,536
3May 25, 2026 20:295,94959,349,27343,917,0005,461,0002,117,632
4May 25, 2026 20:296,02661,108,66744,617,0005,407,0002,113,536
5May 25, 2026 20:296,04659,586,99944,751,0005,434,0002,113,536
6May 25, 2026 20:296,05162,456,94644,591,0005,640,0002,117,632
7May 25, 2026 20:296,16561,264,84345,801,0005,375,0002,117,632
8May 25, 2026 20:296,29563,515,82146,474,0005,775,0002,113,536
9May 25, 2026 20:296,30165,033,05546,517,0005,789,0002,117,632