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 21, 2026 14:58Victor MerckléVictor MerckléScore: 4,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:594,59146,003,16437,039,0001,071,0002,113,536
2May 21, 2026 14:594,59547,005,90037,060,0001,081,0002,113,536
3May 21, 2026 14:594,60646,108,33137,213,0001,020,0002,113,536
4May 21, 2026 14:594,60746,094,40737,238,0001,003,0002,113,536
5May 21, 2026 14:594,61146,139,55737,276,0001,003,0002,113,536
6May 21, 2026 14:594,61546,107,65237,305,0001,006,0002,113,536
7May 21, 2026 14:594,62246,156,30937,340,0001,030,0002,113,536
8May 21, 2026 14:594,62646,341,19037,369,0001,028,0002,113,536
9May 21, 2026 14:594,63146,387,06037,381,0001,059,0002,113,536