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 10, 2026 13:06wnwnScore: 3,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:093,63338,727,76429,077,0001,081,0002,113,536
2May 10, 2026 13:093,64440,863,10229,159,0001,089,0002,113,536
3May 10, 2026 13:093,68641,412,83429,520,0001,079,0002,113,536
4May 10, 2026 13:093,72341,381,15129,828,0001,080,0002,113,536
5May 10, 2026 13:093,72441,898,50929,823,0001,093,0002,113,536
6May 10, 2026 13:093,77447,256,89230,246,0001,085,0002,113,536
7May 10, 2026 13:093,77740,189,21230,260,0001,094,0002,113,536
8May 10, 2026 13:093,78042,614,53030,281,0001,101,0002,113,536
9May 10, 2026 13:093,78342,245,23430,326,0001,079,0002,113,536