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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:48040,015,83230,723,0001,016,0002,113,536expected "74600294196621100 ", got "74534897257883570 "
2Jul 6, 2026 17:48040,670,88431,654,0001,031,0002,113,536expected "74600294196621100 ", got "74535239726179300 "
3Jul 6, 2026 17:48039,709,68030,256,0001,012,0002,113,536expected "74600294196621100 ", got "76197269416779823 "
4Apr 19, 2026 06:133,72355,957,88328,905,0001,993,0002,498,560
5Apr 19, 2026 06:133,74649,756,01629,089,0002,006,0002,535,424
6Apr 19, 2026 06:133,83760,820,05129,856,0001,990,0002,277,376