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 29, 2026 18:30Victor MerckléVictor MerckléScore: 15,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 18:3115,153133,568,821124,704,0001,069,0002,117,632stderr
2Jun 29, 2026 18:3115,175133,766,357124,780,0001,175,0002,117,632stderr
3Jun 29, 2026 18:3115,242134,330,509125,461,0001,053,0002,117,632stderr
4Jun 29, 2026 18:3115,249134,373,729125,430,0001,143,0002,117,632stderr
5Jun 29, 2026 18:3115,267134,533,606125,687,0001,032,0002,117,632stderr
6Jun 29, 2026 18:3115,273134,625,599125,709,0001,060,0002,117,632stderr
7Jun 29, 2026 18:3115,307135,012,316125,964,0001,090,0002,117,632stderr
8Jun 29, 2026 18:3115,359135,418,738126,396,0001,088,0002,117,632stderr
9Jun 29, 2026 18:3115,383135,514,035126,676,0001,006,0002,117,632stderr