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 17, 2026 10:16wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:23043,563,76534,375,0001,081,0002,113,536expected "74600294196621100 ", got "73597685861107500 "
2Jul 6, 2026 23:23043,019,75733,794,0001,080,0002,113,536expected "74600294196621100 ", got "73597935217697580 "
3Jul 6, 2026 23:23041,041,92632,032,0001,110,0002,113,536expected "74600294196621100 ", got "73520199483639340 "
4Mar 17, 2026 10:164,28362,892,16234,537,0001,015,0002,482,176
5Mar 17, 2026 10:164,28359,660,17734,538,0001,015,0002,486,272
6Mar 17, 2026 10:164,31766,077,22433,841,0001,990,0002,273,280