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 12, 2026 15:22highload-churnerhighload-churnerScore: 3,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:233,44937,642,51528,629,000020,480
2Oct 12, 2026 15:233,44937,630,25228,627,000020,480
3Oct 12, 2026 15:233,45937,699,73428,715,000020,480
4Oct 12, 2026 15:233,46837,701,92828,785,000020,480
5Oct 12, 2026 15:233,48037,852,37428,888,000020,480
6Oct 12, 2026 15:233,50838,089,88729,121,000020,480
7Oct 12, 2026 15:233,56038,532,75628,544,0001,006,00020,480
8Oct 12, 2026 15:233,60938,879,40029,961,000020,480
9Oct 12, 2026 15:233,61138,995,35929,979,000020,480