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 22, 2026 18:26Kasper KivimäkiKasper KivimäkiScore: 58,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:2757,982491,320,947426,749,00054,502,0002,113,536
2Jul 22, 2026 18:2758,029492,053,875426,117,00055,525,0002,113,536
3Jul 22, 2026 18:2758,065492,600,173426,396,00055,550,0002,113,536
4Jul 22, 2026 18:2758,109492,234,371426,773,00055,532,0002,113,536
5Jul 22, 2026 18:2758,151493,173,923427,140,00055,515,0002,113,536
6Jul 22, 2026 18:2758,152492,624,775426,146,00056,519,0002,113,536
7Jul 22, 2026 18:2758,177493,396,279426,362,00056,514,0002,113,536
8Jul 22, 2026 18:2758,186492,910,770426,410,00056,539,0002,113,536
9Jul 22, 2026 18:2758,224493,902,784426,771,00056,494,0002,113,536