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 20, 2026 15:56Maya RebholzMaya RebholzScore: 15,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:5715,115137,716,353123,259,0002,197,0002,113,536
2May 20, 2026 15:5715,115134,678,095123,255,0002,200,0002,113,536
3May 20, 2026 15:5715,115136,527,232122,254,0003,207,0002,113,536
4May 20, 2026 15:5715,118137,030,872123,273,0002,208,0002,113,536
5May 20, 2026 15:5715,121135,970,423122,300,0003,210,0002,113,536
6May 20, 2026 15:5715,121135,022,406122,273,0003,232,0002,113,536
7May 20, 2026 15:5715,127135,044,382122,347,0003,210,0002,113,536
8May 20, 2026 15:5715,132135,780,831122,426,0003,174,0002,113,536
9May 20, 2026 15:5715,156150,198,458122,550,0003,250,0002,113,536