Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 15, 2026 01:37highload-churnerhighload-churnerScore: 2,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 01:382,48729,399,93720,395,000020,480
2Oct 15, 2026 01:382,49029,450,28920,421,000020,480
3Oct 15, 2026 01:382,49829,488,44020,485,000020,480
4Oct 15, 2026 01:382,49929,590,26820,495,000020,480
5Oct 15, 2026 01:382,50429,508,03720,535,000020,480
6Oct 15, 2026 01:383,64338,846,88126,420,0003,458,00020,480
7Oct 15, 2026 01:383,64738,941,69826,581,0003,329,00020,480
8Oct 15, 2026 01:384,10842,721,16730,505,0003,184,00020,480
9Oct 15, 2026 01:385,91057,484,26144,948,0003,517,00020,480