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 03:14CheckHarryCheckHarryScore: 7,042Success
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 03:146,99067,904,07457,017,0001,007,0002,113,536
2Sep 6, 2026 03:147,01868,142,29257,247,0001,006,0002,113,536
3Sep 6, 2026 03:147,02868,257,30457,297,0001,041,0002,113,536
4Sep 6, 2026 03:147,03368,264,78757,364,0001,016,0002,113,536
5Sep 6, 2026 03:147,04268,367,08857,433,0001,017,0002,113,536
6Sep 6, 2026 03:147,10178,014,79857,900,0001,045,0002,113,536
7Sep 6, 2026 03:147,13369,108,95258,197,0001,010,0002,113,536
8Sep 6, 2026 03:147,19669,586,50758,716,0001,013,0002,113,536
9Sep 6, 2026 03:147,40581,526,97160,363,0001,099,0002,113,536