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 listJul 25, 2026 21:58Kevin HeaveyKevin HeaveyScore: 3,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 22:013,53239,283,44128,115,0001,206,0002,113,536
2Jul 25, 2026 22:013,54339,323,93428,283,0001,128,0002,113,536
3Jul 25, 2026 22:013,62040,024,86328,898,0001,151,0002,113,536
4Jul 25, 2026 22:013,69446,399,75429,495,0001,169,0002,113,536
5Jul 25, 2026 22:013,72640,901,99129,798,0001,129,0002,113,536
6Jul 25, 2026 22:013,80541,470,14130,462,0001,122,0002,113,536
7Jul 25, 2026 22:013,83841,845,05530,676,0001,187,0002,113,536
8Jul 25, 2026 22:013,84441,930,28730,769,0001,141,0002,113,536
9Jul 25, 2026 22:013,86042,051,21630,880,0001,165,0002,113,536