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 23:12Victor MerckléVictor MerckléScore: 7,585Success
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 23:127,57971,846,33162,911,00002,113,536
2May 13, 2026 23:127,58171,693,54562,929,00002,113,536
3May 13, 2026 23:127,58370,407,97162,939,00002,113,536
4May 13, 2026 23:127,58570,331,61862,956,00002,113,536
5May 13, 2026 23:127,58570,314,54861,921,0001,040,0002,113,536
6May 13, 2026 23:127,58672,350,12861,964,0001,004,0002,113,536
7May 13, 2026 23:127,59870,389,21162,056,0001,011,0002,113,536
8May 13, 2026 23:127,59870,759,36862,019,0001,046,0002,113,536
9May 13, 2026 23:127,83574,108,53063,991,0001,040,0002,113,536