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:39CheckHarryCheckHarryScore: 8,995Success
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:398,98284,545,45773,368,0001,190,0002,113,536
2Sep 3, 2026 03:398,98884,419,78773,426,0001,176,0002,113,536
3Sep 3, 2026 03:398,99284,482,44373,634,0001,006,0002,113,536
4Sep 3, 2026 03:398,99384,521,73173,605,0001,038,0002,113,536
5Sep 3, 2026 03:398,99584,499,21073,616,0001,049,0002,113,536
6Sep 3, 2026 03:398,99884,543,48473,632,0001,052,0002,113,536
7Sep 3, 2026 03:399,00084,569,75073,649,0001,056,0002,113,536
8Sep 3, 2026 03:399,02584,633,94473,743,0001,165,0002,113,536
9Sep 3, 2026 03:399,13285,579,42474,791,0001,006,0002,113,536