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 13, 2026 15:43Victor MerckléVictor MerckléScore: 7,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:437,88172,764,57564,370,0001,044,0002,113,536
2May 13, 2026 15:437,88475,427,89964,426,0001,018,0002,113,536
3May 13, 2026 15:437,88574,078,10064,434,0001,019,0002,113,536
4May 13, 2026 15:437,88673,878,13264,449,0001,006,0002,113,536
5May 13, 2026 15:437,89073,160,85264,484,0001,009,0002,113,536
6May 13, 2026 15:437,89373,095,03664,468,0001,045,0002,113,536
7May 13, 2026 15:437,90075,120,88164,460,0001,111,0002,113,536
8May 13, 2026 15:438,02475,810,31165,574,0001,026,0002,113,536
9May 13, 2026 15:438,04276,693,70765,707,0001,043,0002,113,536