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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:11Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:11044,781,46533,449,0001,189,0002,113,536expected "74600294196621100 ", got "74924900247412828 "
2Jul 6, 2026 21:11044,829,18333,510,0001,165,0002,113,536expected "74600294196621100 ", got "74924958951188618 "
3Jul 6, 2026 21:11044,211,08232,386,0001,036,0002,113,536expected "74600294196621100 ", got "74534897407296230 "
4Apr 19, 2026 09:454,20361,866,98332,888,0001,993,0002,277,376
5Apr 19, 2026 09:454,20358,255,77333,856,0001,025,0002,523,136
6Apr 19, 2026 09:454,20563,637,01932,911,0001,994,0002,281,472