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 27, 2026 05:52Victor MerckléVictor MerckléScore: 3,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:533,69739,051,80129,576,0001,113,0002,117,632stderr
2Aug 27, 2026 05:533,70539,101,34229,485,0001,268,0002,117,632stderr
3Aug 27, 2026 05:533,71239,201,98929,577,0001,233,0002,117,632stderr
4Aug 27, 2026 05:533,71639,934,39429,799,0001,046,0002,117,632stderr
5Aug 27, 2026 05:533,71739,219,25629,666,0001,189,0002,117,632stderr
6Aug 27, 2026 05:533,71939,233,89629,675,0001,198,0002,117,632stderr
7Aug 27, 2026 05:533,72039,921,85229,596,0001,281,0002,117,632stderr
8Aug 27, 2026 05:533,73239,368,06229,705,0001,276,0002,117,632stderr
9Aug 27, 2026 05:533,84049,355,89130,699,0001,177,0002,117,632stderr