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 07:26wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:14041,966,68332,868,0001,070,0002,113,536expected "74600294196621100 ", got "74098886929837100 "
2Jul 6, 2026 21:14037,305,03428,373,0001,105,0002,113,536expected "74600294196621100 ", got "72979770530267948 "
3Jul 6, 2026 21:14037,891,35428,815,0001,093,0002,113,536expected "74600294196621100 ", got "72477573557094700 "
4Apr 14, 2026 07:274,07657,586,05731,843,0001,990,0002,486,272
5Apr 14, 2026 07:264,16957,327,84033,583,0001,017,0002,535,424
6Apr 14, 2026 07:274,20062,787,21132,872,0001,992,0002,277,376
7Apr 14, 2026 07:264,20962,171,77232,940,0001,996,0002,490,368
8Apr 14, 2026 07:264,23454,254,87633,132,0002,008,0002,277,376
9Apr 14, 2026 07:274,25756,387,99634,324,0001,009,0002,277,376