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 listApr 16, 2026 02:07olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:14047,790,25037,309,0001,027,0002,113,536expected "74600294196621100 ", got "36672912308295468 "
2Jul 7, 2026 05:14047,508,31236,831,0001,207,0002,113,536expected "74600294196621100 ", got "36666849870038572 "
3Jul 7, 2026 05:14047,652,49436,896,0001,301,0002,113,536expected "74600294196621100 ", got "36674165319257388 "
4Apr 16, 2026 02:075,59971,581,29642,429,0004,040,0002,338,816
5Apr 16, 2026 02:075,63972,906,76241,828,0004,979,0002,437,120
6Apr 16, 2026 02:075,81774,296,04545,264,0003,017,0002,437,120