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 11, 2026 13:33wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:40041,656,35032,339,0001,204,0002,113,536expected "74600294196621100 ", got "74222831981325100 "
2Jul 6, 2026 21:40040,701,89131,543,0001,108,0002,113,536expected "74600294196621100 ", got "73838751099755820 "
3Jul 6, 2026 21:40043,037,10533,914,0001,064,0002,113,536expected "74600294196621100 ", got "74220943224701740 "
4Apr 11, 2026 13:334,22858,024,83833,084,0002,005,0002,498,560
5Apr 11, 2026 13:334,24059,387,24933,179,0002,010,0002,494,464
6Apr 11, 2026 13:334,28359,928,88734,538,0001,015,0002,277,376