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 14, 2026 08:45wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:44Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:45037,270,09528,377,0001,082,0002,113,536expected "74600294196621100 ", got "72477185376939308 "
2Jul 6, 2026 18:45036,974,41428,074,0001,082,0002,113,536expected "74600294196621100 ", got "72978147524508972 "
3Jul 6, 2026 18:45037,194,61828,103,0001,101,0002,113,536expected "74600294196621100 ", got "72477028928100140 "
4Apr 14, 2026 08:454,04053,582,94732,518,0001,016,0002,277,376
5Apr 14, 2026 08:454,07560,008,85431,837,0001,989,0002,486,272
6Apr 14, 2026 08:454,55864,667,84636,837,000995,0002,486,272