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 listJun 28, 2026 23:18Victor MerckléVictor MerckléScore: 9,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 23:199,18584,152,31775,107,0001,136,0002,117,632stderr
2Jun 28, 2026 23:199,18984,162,43275,167,0001,105,0002,117,632stderr
3Jun 28, 2026 23:199,21284,312,51975,328,0001,132,0002,117,632stderr
4Jun 28, 2026 23:199,24484,729,04175,680,0001,048,0002,117,632stderr
5Jun 28, 2026 23:199,25284,733,23675,703,0001,091,0002,117,632stderr
6Jun 28, 2026 23:199,31485,291,60476,186,0001,123,0002,117,632stderr
7Jun 28, 2026 23:199,44686,307,89577,334,0001,070,0002,117,632stderr
8Jun 28, 2026 23:199,45486,396,11777,358,0001,117,0002,117,632stderr
9Jun 28, 2026 23:199,53187,039,49978,042,0001,073,0002,117,632stderr