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 11, 2026 13:25wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:28040,631,81331,436,0001,065,0002,113,536expected "74600294196621100 ", got "73843433231357740 "
2Jul 6, 2026 22:28040,768,31831,597,0001,068,0002,113,536expected "74600294196621100 ", got "73838469367109420 "
3Jul 6, 2026 22:28043,317,45634,049,0001,077,0002,113,536expected "74600294196621100 ", got "74221952640276780 "
4Apr 11, 2026 13:254,22558,732,34133,061,0002,003,0002,277,376
5Apr 11, 2026 13:254,26356,020,87534,372,0001,010,0002,498,560
6Apr 11, 2026 13:254,31664,187,79433,832,0001,990,0002,273,280