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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:43038,078,96128,960,0001,100,0002,113,536expected "74600294196621100 ", got "72495669426456876 "
2Jul 6, 2026 20:43037,234,65328,177,0001,103,0002,113,536expected "74600294196621100 ", got "72492247204525100 "
3Jul 6, 2026 20:43040,120,00431,175,0001,097,0002,113,536expected "74600294196621100 ", got "74097226490406444 "
4Apr 14, 2026 09:064,10056,269,09832,027,0002,001,0002,498,560
5Apr 14, 2026 09:064,16261,062,08033,532,0001,016,0002,494,464
6Apr 14, 2026 09:064,19764,349,26732,844,0001,990,0002,277,376