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 14, 2026 21:43wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:59Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:59043,626,62934,321,0001,158,0002,113,536expected "74600294196621100 ", got "73482252150474540 "
2Jul 6, 2026 22:59044,200,91034,463,0001,157,0002,113,536expected "74600294196621100 ", got "73482461504957740 "
3Jul 6, 2026 22:59041,577,39232,340,0001,124,0002,113,536expected "74600294196621100 ", got "72028832760223020 "
4Mar 14, 2026 21:434,26260,577,93534,363,0001,010,0002,486,272
5Mar 14, 2026 21:434,27459,179,45934,459,0001,013,0002,478,080
6Mar 14, 2026 21:434,32160,894,21833,871,0001,992,0002,486,272