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 12, 2026 12:30wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:26043,070,30933,843,0001,080,0002,113,536expected "74600294196621100 ", got "73894511835438380 "
2Jul 6, 2026 22:26043,222,77333,980,0001,091,0002,113,536expected "74600294196621100 ", got "73892280245895980 "
3Jul 6, 2026 22:26043,674,99831,435,0001,070,0002,113,536expected "74600294196621100 ", got "74106534149916460 "
4Apr 12, 2026 12:304,24757,446,83333,239,0002,014,0002,494,464
5Apr 12, 2026 12:304,26261,923,70834,368,0001,010,0002,277,376
6Apr 12, 2026 12:304,28164,874,09134,515,0001,015,0002,277,376