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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:53037,256,11628,004,0001,009,0002,113,536expected "74600294196621100 ", got "74924902156317908 "
2Jul 6, 2026 17:53037,183,90727,711,0001,040,0002,113,536expected "74600294196621100 ", got "74924924705116808 "
3Jul 6, 2026 17:53036,546,71327,733,0001,036,0002,113,536expected "74600294196621100 ", got "74924948304543818 "
4Apr 22, 2026 05:343,71846,340,85128,870,0001,991,0002,330,624
5Apr 22, 2026 05:343,78845,102,14931,441,00002,486,272
6Apr 22, 2026 05:343,81250,223,84930,626,0001,020,0002,486,272