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 3, 2026 03:54CheckHarryCheckHarryScore: 5,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:545,85458,451,23647,438,0001,158,0002,113,536
2Sep 3, 2026 03:545,85458,466,84747,429,0001,166,0002,113,536
3Sep 3, 2026 03:545,85658,504,01847,441,0001,164,0002,113,536
4Sep 3, 2026 03:545,85958,544,46747,473,0001,161,0002,113,536
5Sep 3, 2026 03:545,86558,555,55247,631,0001,052,0002,113,536
6Sep 3, 2026 03:545,86658,534,42347,648,0001,042,0002,113,536
7Sep 3, 2026 03:545,86758,562,57547,657,0001,046,0002,113,536
8Sep 3, 2026 03:545,86758,643,02447,649,0001,051,0002,113,536
9Sep 3, 2026 03:546,00459,712,09148,794,0001,042,0002,113,536