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 04:45wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:35037,561,03428,202,0001,006,0002,113,536expected "74600294196621100 ", got "74924962208315008 "
2Jul 6, 2026 17:35036,092,22527,191,0001,004,0002,113,536expected "74600294196621100 ", got "74924953856579118 "
3Jul 6, 2026 17:35036,816,94427,918,0001,034,0002,113,536expected "74600294196621100 ", got "74924928768063908 "
4Apr 22, 2026 04:463,54243,579,11728,386,0001,013,0002,482,176
5Apr 22, 2026 04:463,64646,421,70429,259,0001,008,0002,494,464
6Apr 22, 2026 04:463,76451,049,72330,241,0001,008,0002,498,560