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 11, 2026 20:45Victor MerckléVictor MerckléScore: 10,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:4510,23195,415,67983,819,0001,100,0002,113,536
2May 11, 2026 20:4510,23595,763,35683,841,0001,117,0002,117,632
3May 11, 2026 20:4510,23694,035,69183,834,0001,126,0002,113,536
4May 11, 2026 20:4510,23694,020,92083,833,0001,133,0002,113,536
5May 11, 2026 20:4510,24196,596,37583,825,0001,179,0002,113,536
6May 11, 2026 20:4510,24296,643,99983,876,0001,135,0002,113,536
7May 11, 2026 20:4510,24595,580,44783,853,0001,186,0002,113,536
8May 11, 2026 20:4510,24995,538,50883,879,0001,188,0002,113,536
9May 11, 2026 20:4510,26795,044,23184,073,0001,148,0002,113,536