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 listApr 22, 2026 10:16wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:08041,279,62830,751,0001,173,0002,113,536expected "74600294196621100 ", got "74594479431252377 "
2Jul 6, 2026 18:08041,182,88230,653,0001,169,0002,113,536expected "74600294196621100 ", got "74593938070984377 "
3Jul 6, 2026 18:08039,604,55329,008,0001,192,0002,113,536expected "74600294196621100 ", got "74924940833861018 "
4Apr 22, 2026 10:163,76349,618,59430,227,0001,007,0002,379,776
5Apr 22, 2026 10:163,81350,215,21130,633,0001,021,0002,371,584
6Apr 22, 2026 10:163,93747,710,86931,657,0001,021,0002,375,680