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:28CheckHarryCheckHarryScore: 18,607Success
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:2818,587164,080,814153,235,0001,042,0002,113,536
2Sep 2, 2026 17:2818,587164,109,339153,231,0001,048,0002,113,536
3Sep 2, 2026 17:2818,589164,110,406153,251,0001,044,0002,113,536
4Sep 2, 2026 17:2818,603164,383,499153,363,0001,045,0002,113,536
5Sep 2, 2026 17:2818,607164,294,817153,386,0001,055,0002,113,536
6Sep 2, 2026 17:2818,628164,414,792153,569,0001,048,0002,113,536
7Sep 2, 2026 17:2818,628164,615,744153,562,0001,054,0002,113,536
8Sep 2, 2026 17:2818,667166,854,579153,890,0001,054,0002,113,536
9Sep 2, 2026 17:2818,691165,087,520154,046,0001,093,0002,113,536