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 13, 2026 11:39wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:37Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:37038,304,75129,383,0001,072,0002,113,536expected "74600294196621100 ", got "72459777682930476 "
2Jul 6, 2026 20:37037,714,73828,559,0001,120,0002,113,536expected "74600294196621100 ", got "72392449851295020 "
3Jul 6, 2026 20:37037,795,07128,885,0001,087,0002,113,536expected "74600294196621100 ", got "72386431460537132 "
4Apr 13, 2026 11:394,11359,849,09732,133,0002,008,0002,502,656
5Apr 13, 2026 11:394,15360,573,44033,458,0001,013,0002,277,376
6Apr 13, 2026 11:394,19663,709,73632,840,0001,990,0002,490,368