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 28, 2026 01:33olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:41047,667,41137,067,0001,026,0002,117,632expected "74600294196621100 ", got "53519447838663724 "
2Jul 7, 2026 05:41048,289,97337,633,0001,025,0002,117,632expected "74600294196621100 ", got "53516298259769132 "
3Jul 7, 2026 05:41047,427,72136,877,0001,024,0002,117,632expected "74600294196621100 ", got "53518971974748716 "
4Mar 28, 2026 01:335,69576,612,55046,264,0001,005,0002,441,216
5Mar 28, 2026 01:335,76378,880,63645,840,0001,993,0002,301,952
6Mar 28, 2026 01:335,83573,330,11246,410,0002,017,0002,310,144