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 24, 2026 19:59Victor MerckléVictor MerckléScore: 4,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:004,50545,443,46536,306,0001,093,0002,117,632stderr
2Jun 24, 2026 20:004,51044,925,00136,322,0001,119,0002,117,632stderr
3Jun 24, 2026 20:004,52045,586,01636,401,0001,117,0002,117,632stderr
4Jun 24, 2026 20:004,52245,177,45036,420,0001,117,0002,117,632stderr
5Jun 24, 2026 20:004,52245,629,77036,449,0001,090,0002,117,632stderr
6Jun 24, 2026 20:004,52645,272,10536,543,0001,028,0002,117,632stderr
7Jun 24, 2026 20:004,52945,292,00836,530,0001,062,0002,117,632stderr
8Jun 24, 2026 20:004,53345,132,52736,524,0001,108,0002,117,632stderr
9Jun 24, 2026 20:004,73447,004,77338,203,0001,092,0002,117,632stderr