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 07:52CheckHarryCheckHarryScore: 4,574Success
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 07:534,56447,721,28036,877,0001,007,0002,113,536
2Sep 6, 2026 07:534,56747,799,59136,901,0001,009,0002,113,536
3Sep 6, 2026 07:534,57047,841,83236,921,0001,014,0002,113,536
4Sep 6, 2026 07:534,57147,778,68736,935,0001,011,0002,113,536
5Sep 6, 2026 07:534,57447,823,10236,959,0001,007,0002,113,536
6Sep 6, 2026 07:534,57647,922,05436,947,0001,035,0002,113,536
7Sep 6, 2026 07:534,57856,437,93436,936,0001,063,0002,113,536
8Sep 6, 2026 07:534,58647,932,75037,055,0001,011,0002,113,536
9Sep 6, 2026 07:534,60448,039,51137,205,0001,009,0002,113,536