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 listApr 6, 2026 13:47Danylo MocherniukDanylo MocherniukScore: 7,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 13:487,32588,140,65255,814,0004,983,0002,396,160
2Apr 6, 2026 13:487,32985,126,15954,850,0005,983,0002,392,064
3Apr 6, 2026 13:477,33388,221,07355,876,0004,989,0002,408,448
4Apr 6, 2026 13:477,36092,137,76159,083,0002,002,0002,400,256
5Apr 6, 2026 13:477,40884,063,99157,455,0004,031,0002,461,696
6Apr 6, 2026 13:487,44685,250,85755,823,0005,981,0002,498,560