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 14, 2026 05:53wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:18039,565,24130,351,0001,077,0002,113,536expected "74600294196621100 ", got "72479788231232812 "
2Jul 6, 2026 21:18039,561,62630,378,0001,098,0002,113,536expected "74600294196621100 ", got "72481506664465708 "
3Jul 6, 2026 21:18040,996,22831,387,0001,075,0002,113,536expected "74600294196621100 ", got "72475226733634860 "
4Apr 14, 2026 05:534,21262,248,22132,966,0001,997,0002,277,376
5Apr 14, 2026 05:534,21356,938,16232,970,0001,998,0002,277,376
6Apr 14, 2026 05:534,22261,510,67433,041,0002,002,0002,277,376