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 listSep 6, 2026 09:11Kevin HeaveyKevin HeaveyScore: 3,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:123,57239,676,13928,490,0001,159,0002,113,536
2Sep 6, 2026 09:123,58239,880,23428,557,0001,177,0002,113,536
3Sep 6, 2026 09:123,69140,700,33529,495,0001,144,0002,113,536
4Sep 6, 2026 09:123,69941,951,84929,503,0001,202,0002,113,536
5Sep 6, 2026 09:123,70940,790,09329,641,0001,151,0002,113,536
6Sep 6, 2026 09:123,81041,629,96330,584,0001,043,0002,113,536
7Sep 6, 2026 09:123,83341,903,22130,651,0001,165,0002,113,536
8Sep 6, 2026 09:123,83541,906,03030,680,0001,153,0002,113,536
9Sep 6, 2026 09:123,86542,150,55130,928,0001,153,0002,113,536