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:40wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:02050,500,99434,560,0007,328,0002,113,536expected "74600294196621100 ", got "73485094603261740 "
2Jul 6, 2026 23:02046,058,25532,226,0005,732,0002,113,536expected "74600294196621100 ", got "72051366862456876 "
3Jul 6, 2026 23:02049,606,40434,576,0006,471,0002,113,536expected "74600294196621100 ", got "73482672616834860 "
4Mar 14, 2026 21:404,25662,154,23234,319,0001,009,0002,498,560
5Mar 14, 2026 21:404,27656,444,17234,474,0001,013,0002,273,280
6Mar 14, 2026 21:404,28459,853,55434,545,0001,016,0002,273,280