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:48Victor MerckléVictor MerckléScore: 7,888Success
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:487,88184,070,23365,419,00002,113,536
2May 13, 2026 15:487,88672,776,67264,422,0001,037,0002,113,536
3May 13, 2026 15:487,88775,563,83964,413,0001,052,0002,113,536
4May 13, 2026 15:487,88773,100,90864,419,0001,044,0002,113,536
5May 13, 2026 15:487,88873,002,38664,459,0001,013,0002,113,536
6May 13, 2026 15:487,88984,004,33764,456,0001,030,0002,113,536
7May 13, 2026 15:487,89075,806,66064,474,0001,017,0002,113,536
8May 13, 2026 15:487,90075,044,33164,563,0001,013,0002,113,536
9May 13, 2026 15:488,04185,337,37565,717,0001,030,0002,113,536