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 listAug 11, 2026 17:13Victor MerckléVictor MerckléScore: 3,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:133,85741,990,56830,814,0001,202,0002,117,632stderr
2Aug 11, 2026 17:133,85840,347,38330,842,0001,185,0002,117,632stderr
3Aug 11, 2026 17:133,85940,398,99230,854,0001,183,0002,117,632stderr
4Aug 11, 2026 17:133,87440,538,41031,043,0001,117,0002,117,632stderr
5Aug 11, 2026 17:133,87840,577,66931,049,0001,146,0002,117,632stderr
6Aug 11, 2026 17:133,88140,620,44431,077,0001,142,0002,117,632stderr
7Aug 11, 2026 17:133,89740,780,59231,150,0001,198,0002,117,632stderr
8Aug 11, 2026 17:133,91440,872,74331,366,0001,123,0002,117,632stderr
9Aug 11, 2026 17:134,12043,212,23133,072,0001,126,0002,117,632stderr