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 listMay 21, 2026 13:28Victor MerckléVictor MerckléScore: 5,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:295,75456,862,24346,693,0001,073,0002,113,536
2May 21, 2026 13:295,76756,006,21546,817,0001,051,0002,113,536
3May 21, 2026 13:295,78057,268,09046,977,0001,003,0002,113,536
4May 21, 2026 13:295,78456,745,85946,979,0001,036,0002,113,536
5May 21, 2026 13:295,78856,843,82747,007,0001,034,0002,113,536
6May 21, 2026 13:295,80656,942,95247,158,0001,033,0002,113,536
7May 21, 2026 13:295,81357,881,55247,243,0001,012,0002,113,536
8May 21, 2026 13:295,82156,164,49647,305,0001,013,0002,113,536
9May 21, 2026 13:295,85459,364,07647,543,0001,052,0002,113,536