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 05:58CheckHarryCheckHarryScore: 5,061Success
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 05:585,01551,485,48840,605,0001,024,0002,113,536
2Sep 3, 2026 05:585,04751,731,48939,853,0002,044,0002,113,536
3Sep 3, 2026 05:585,05351,815,27540,920,0001,024,0002,113,536
4Sep 3, 2026 05:585,05551,852,78239,934,0002,030,0002,113,536
5Sep 3, 2026 05:585,06151,821,52139,962,0002,045,0002,113,536
6Sep 3, 2026 05:585,07051,992,19240,019,0002,062,0002,113,536
7Sep 3, 2026 05:585,09952,216,88140,250,0002,073,0002,113,536
8Sep 3, 2026 05:585,10652,309,80840,315,0002,073,0002,113,536
9Sep 3, 2026 05:585,10652,167,42440,330,0002,053,0002,113,536