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 09:48Victor MerckléVictor MerckléScore: 5,844Success
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 09:495,81656,329,89147,217,0001,057,0002,113,536
2May 21, 2026 09:495,81956,184,68447,248,0001,056,0002,113,536
3May 21, 2026 09:495,83356,265,17647,352,0001,062,0002,113,536
4May 21, 2026 09:495,83657,891,55147,383,0001,060,0002,113,536
5May 21, 2026 09:495,84457,999,55547,442,0001,068,0002,113,536
6May 21, 2026 09:495,85058,276,35747,542,0001,020,0002,113,536
7May 21, 2026 09:495,86058,082,40347,605,0001,036,0002,113,536
8May 21, 2026 09:496,00658,189,85948,787,0001,065,0002,113,536
9May 21, 2026 09:496,03959,596,04049,059,0001,068,0002,113,536