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 03:43wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:51043,027,13433,946,0001,010,0002,113,536expected "74600294196621100 ", got "74534441118635170 "
2Jul 6, 2026 20:51041,949,17332,858,0001,022,0002,113,536expected "74600294196621100 ", got "74534437817254060 "
3Jul 6, 2026 20:51042,615,80433,614,0001,017,0002,113,536expected "74600294196621100 ", got "74534437595783730 "
4Apr 19, 2026 03:434,16055,335,46933,515,0001,015,0002,277,376
5Apr 19, 2026 03:434,16762,786,38033,567,0001,017,0002,269,184
6Apr 19, 2026 03:434,19757,785,63032,841,0001,990,0002,486,272