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 listOct 16, 2026 18:18KacpxerKacpxerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:12Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 16:13030,030,289,62930,018,122,0001,005,00016,384Killed by timeout
2Oct 16, 2026 18:188,61382,059,05270,220,0001,276,0002,113,536
3Oct 16, 2026 18:188,63582,184,33670,394,0001,280,0002,113,536
4Oct 16, 2026 18:188,64182,201,62870,714,0001,009,0002,113,536
5Oct 16, 2026 18:188,65482,374,88970,826,0001,010,0002,113,536
6Oct 16, 2026 18:188,70482,715,11971,052,0001,194,0002,113,536
7Oct 16, 2026 18:188,74783,173,04471,594,0001,007,0002,113,536
8Oct 16, 2026 18:188,76783,290,62471,763,0001,008,0002,113,536
9Oct 16, 2026 18:188,82583,745,43772,150,0001,105,0002,113,536
10Oct 16, 2026 18:188,87384,161,61272,639,0001,008,0002,113,536