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 listMar 18, 2026 03:25Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:26047,367,52336,702,0001,016,0002,113,536expected "74600294196621100 ", got "15171594096240887 "
2Jul 7, 2026 03:26047,681,92636,936,0001,020,0002,113,536expected "74600294196621100 ", got "15171666185858860 "
3Jul 7, 2026 03:26047,482,74936,795,0001,017,0002,113,536expected "74600294196621100 ", got "15179006946029356 "
4Mar 18, 2026 03:254,74661,672,44138,383,0001,010,0002,285,568
5Mar 18, 2026 03:254,86463,866,07538,350,0002,018,0002,310,144
6Mar 18, 2026 03:254,88067,180,15439,496,0001,012,0002,285,568