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 11:41wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:15Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:15040,230,63231,282,0001,046,0002,113,536expected "74600294196621100 ", got "74097907372911660 "
2Jul 6, 2026 20:15037,624,61328,626,0001,113,0002,113,536expected "74600294196621100 ", got "72222595432295468 "
3Jul 6, 2026 20:15041,392,66632,363,0001,109,0002,113,536expected "74600294196621100 ", got "73766738195969068 "
4Apr 13, 2026 11:414,08758,057,84731,928,0001,995,0002,277,376
5Apr 13, 2026 11:414,11254,541,74632,121,0002,007,0002,277,376
6Apr 13, 2026 11:414,11755,106,27232,158,0002,009,0002,494,464