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:24Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:20047,642,16936,926,0001,018,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:20047,738,29137,012,0001,019,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:20048,690,54137,380,0001,020,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 03:244,79773,096,29236,831,0002,986,0002,416,640
5Mar 18, 2026 03:244,79767,568,30537,825,0001,990,0002,301,952
6Mar 18, 2026 03:244,94669,684,13039,047,0002,002,0002,297,856