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 listSep 17, 2026 02:00Victor MerckléVictor MerckléScore: 32,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:0232,215277,199,173266,317,0001,069,0002,117,632stderr
2Sep 17, 2026 02:0232,301278,380,366267,025,0001,081,0002,117,632stderr
3Sep 17, 2026 02:0232,325278,166,462267,230,0001,074,0002,117,632stderr
4Sep 17, 2026 02:0232,400278,842,104267,776,0001,151,0002,117,632stderr
5Sep 17, 2026 02:0232,449279,210,216268,233,0001,101,0002,117,632stderr
6Sep 17, 2026 02:0232,496279,716,241268,629,0001,093,0002,117,632stderr
7Sep 17, 2026 02:0232,571280,271,641269,338,0001,004,0002,117,632stderr
8Sep 17, 2026 02:0232,755281,772,564270,780,0001,088,0002,117,632stderr
9Sep 17, 2026 02:0232,877282,824,793271,794,0001,091,0002,117,632stderr