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 14, 2026 15:28highload-churnerhighload-churnerScore: 3,189Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 18:06Kacpxer10.00RecheckSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:073,18235,563,73926,416,000020,480
2Oct 14, 2026 15:293,18335,342,95426,422,000020,480
3Oct 14, 2026 15:293,18335,361,31126,425,000020,480
4Oct 14, 2026 15:293,18535,988,31626,436,000020,480
5Oct 14, 2026 15:293,18735,433,85726,455,000020,480
6Oct 14, 2026 15:293,18936,037,58226,470,000020,480
7Oct 16, 2026 18:073,18935,482,32726,470,000020,480
8Oct 16, 2026 18:073,19035,580,53726,481,000020,480
9Oct 14, 2026 15:293,19335,536,33026,504,000020,480
10Oct 14, 2026 15:293,19535,439,89426,521,000020,480
11Oct 14, 2026 15:293,20335,548,10426,588,000020,480
12Oct 14, 2026 15:293,33747,243,92827,699,000020,480