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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:17037,403,43328,314,0001,142,0002,113,536expected "74600294196621100 ", got "72980234671426860 "
2Jul 6, 2026 20:17037,521,72228,371,0001,102,0002,113,536expected "74600294196621100 ", got "72478972449907244 "
3Jul 6, 2026 20:17040,137,15031,136,0001,073,0002,113,536expected "74600294196621100 ", got "74070171447687468 "
4Apr 13, 2026 12:454,09154,697,84831,959,0001,997,0002,277,376
5Apr 13, 2026 12:454,11561,353,51032,144,0002,009,0002,490,368
6Apr 13, 2026 12:454,13053,330,37632,259,0002,016,0002,277,376