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:54CheckHarryCheckHarryScore: 10,023Success
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:579,99692,950,50273,551,0009,421,0002,113,536
2Sep 6, 2026 11:5710,00192,984,23673,464,0009,550,0002,113,536
3Sep 6, 2026 11:5710,00393,014,93073,543,0009,489,0002,113,536
4Sep 6, 2026 11:5710,02193,132,88773,704,0009,476,0002,113,536
5Sep 6, 2026 11:5710,02393,204,77373,648,0009,545,0002,113,536
6Sep 6, 2026 11:5710,05693,492,97173,551,0009,915,0002,113,536
7Sep 6, 2026 11:5710,07593,624,27673,524,00010,100,0002,113,536
8Sep 6, 2026 11:5710,09593,703,50174,310,0009,484,0002,113,536
9Sep 6, 2026 11:5710,17994,539,96474,965,0009,526,0002,113,536