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 listJan 30, 2026 04:28Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:46Tomislav Tunkovic114.75CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:470413,982,780404,598,0001,001,0002,113,536expected "53671018022183363 ", got "53676260478612659 "
2Sep 9, 2026 10:47086,473,20677,014,0001,045,0002,113,536expected "0 ", got "12525968374076 "
3Sep 9, 2026 10:470414,946,096405,189,0001,224,0002,113,536expected "53669627294312045 ", got "53675389686578114 "
4Jan 30, 2026 04:286,33075,650,19750,520,0002,020,0002,277,376
5Jan 30, 2026 04:286,44374,995,89852,469,0001,009,0002,527,232
6Jan 30, 2026 04:286,48082,006,92051,793,0001,992,0002,523,136
7Jan 30, 2026 04:286,49078,465,74351,876,0001,995,0002,514,944
8Jan 30, 2026 04:286,56378,690,81053,462,0001,008,0002,469,888
9Jan 30, 2026 04:286,82679,263,23955,646,0001,011,0002,273,280