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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:20037,470,61628,255,0001,118,0002,113,536expected "74600294196621100 ", got "72980989663258412 "
2Jul 6, 2026 20:20036,892,01127,997,0001,085,0002,113,536expected "74600294196621100 ", got "71596846589209388 "
3Jul 6, 2026 20:20037,448,22828,442,0001,106,0002,113,536expected "74600294196621100 ", got "72475924773582892 "
4Apr 13, 2026 12:534,07757,679,47231,847,0001,990,0002,498,560
5Apr 13, 2026 12:534,11853,508,19432,170,0002,010,0002,277,376
6Apr 13, 2026 12:534,22255,197,42933,040,0002,002,0002,478,080