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 2, 2026 17:34CheckHarryCheckHarryScore: 6,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:356,90767,243,00356,290,0001,042,0002,113,536
2Sep 2, 2026 17:356,91067,151,11856,311,0001,046,0002,113,536
3Sep 2, 2026 17:356,92567,314,60956,412,0001,072,0002,113,536
4Sep 2, 2026 17:356,93067,290,17956,469,0001,054,0002,113,536
5Sep 2, 2026 17:356,93267,341,03056,497,0001,045,0002,113,536
6Sep 2, 2026 17:356,93667,394,88956,534,0001,043,0002,113,536
7Sep 2, 2026 17:356,94567,531,73856,588,0001,056,0002,113,536
8Sep 2, 2026 17:356,94567,500,75956,588,0001,058,0002,113,536
9Sep 2, 2026 17:356,99167,882,75256,954,0001,073,0002,113,536