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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:486,96966,850,88156,807,0001,037,0002,113,536
2May 15, 2026 13:486,97368,577,58756,871,0001,006,0002,113,536
3May 15, 2026 13:486,97467,094,94057,887,00002,113,536
4May 15, 2026 13:486,97965,666,54756,922,0001,004,0002,113,536
5May 15, 2026 13:487,01965,542,19257,214,0001,044,0002,113,536
6May 15, 2026 13:487,03868,737,92358,420,00002,113,536
7May 15, 2026 13:487,04366,266,64157,454,0001,004,0002,113,536
8May 15, 2026 13:487,05167,804,68457,488,0001,042,0002,113,536
9May 15, 2026 13:487,09866,166,79857,899,0001,017,0002,113,536