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 11:24Kevin HeaveyKevin HeaveyScore: 3,549Success
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 11:263,51739,101,69528,111,0001,081,0002,113,536
2Sep 6, 2026 11:263,52639,664,91228,232,0001,036,0002,113,536
3Sep 6, 2026 11:263,53837,664,95928,160,0001,208,0002,113,536
4Sep 6, 2026 11:263,54837,884,88328,235,0001,215,0002,113,536
5Sep 6, 2026 11:263,54939,712,26328,375,0001,082,0002,113,536
6Sep 6, 2026 11:263,55637,861,09728,316,0001,201,0002,113,536
7Sep 6, 2026 11:263,55639,443,30728,412,0001,106,0002,113,536
8Sep 6, 2026 11:263,70439,835,69229,712,0001,034,0002,113,536
9Sep 6, 2026 11:263,83441,446,07530,758,0001,068,0002,113,536