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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:05Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:05041,366,93732,262,0001,070,0002,113,536expected "74600294196621100 ", got "74041977828304940 "
2Jul 6, 2026 20:05039,478,06030,322,0001,104,0002,113,536expected "74600294196621100 ", got "68031203007492396 "
3Jul 6, 2026 20:05037,289,98328,110,0001,105,0002,113,536expected "74600294196621100 ", got "72983430599130668 "
4Apr 14, 2026 10:374,03855,636,46032,501,0001,015,0002,498,560
5Apr 14, 2026 10:374,09662,418,22931,996,0001,999,0002,277,376
6Apr 14, 2026 10:374,16665,355,88733,562,0001,017,0002,277,376