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 14:37highload-churnerhighload-churnerScore: 3,193Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 22:28Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 14:383,18435,965,64826,429,000020,480
2Oct 14, 2026 14:383,18735,414,37826,456,000020,480
3Oct 14, 2026 14:383,19036,069,95626,482,000020,480
4Oct 14, 2026 14:383,19235,972,10326,496,000020,480
5Oct 14, 2026 14:383,19336,078,23126,506,000020,480
6Oct 14, 2026 14:383,19436,096,02926,512,000020,480
7Oct 14, 2026 14:383,19535,481,14126,521,000020,480
8Oct 14, 2026 14:383,19735,519,37826,542,000020,480
9Oct 14, 2026 14:383,20335,603,13626,589,000020,480