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 22, 2026 10:00wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 16:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 16:25036,990,72027,619,0001,002,0002,113,536expected "74600294196621100 ", got "74924935320842108 "
2Jul 6, 2026 16:25038,477,72629,473,0001,017,0002,113,536expected "74600294196621100 ", got "74588611704520277 "
3Jul 6, 2026 16:25036,908,36527,983,0001,029,0002,113,536expected "74600294196621100 ", got "75516977695470319 "
4Apr 22, 2026 10:003,46343,744,89727,721,0001,026,0002,490,368
5Apr 22, 2026 10:003,49245,812,20126,989,0001,999,0002,478,080
6Apr 22, 2026 10:003,80953,270,41430,601,0001,020,0002,334,720