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 19, 2026 07:09wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:27035,767,31826,818,0001,009,0002,113,536expected "74600294196621100 ", got "74924845141650886 "
2Jul 6, 2026 17:27037,483,20928,685,0001,027,0002,113,536expected "74600294196621100 ", got "74594631018234761 "
3Jul 6, 2026 17:27035,340,02026,507,0001,039,0002,113,536expected "74600294196621100 ", got "74924822586089686 "
4Apr 19, 2026 07:093,54749,735,27728,423,0001,015,0002,531,328
5Apr 19, 2026 07:083,59258,080,76627,825,0001,987,0002,277,376
6Apr 19, 2026 07:083,59655,518,96227,854,0001,989,0002,494,464
7Apr 19, 2026 07:093,59858,596,17627,871,0001,990,0002,498,560
8Apr 19, 2026 07:093,74155,169,61529,050,0002,003,0002,277,376
9Apr 19, 2026 07:083,77854,679,16430,348,0001,011,0002,277,376