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 9, 2026 15:41Karthik ReddyKarthik ReddyScore: 2,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:232,53929,675,32720,824,000020,480
2Oct 9, 2026 16:232,54429,709,25620,867,000020,480
3Oct 9, 2026 16:232,54429,779,97520,864,000020,480
4Oct 9, 2026 16:232,54432,613,13120,868,000020,480
5Oct 9, 2026 16:232,54529,800,32220,869,000020,480
6Oct 9, 2026 16:232,55029,845,03720,914,000020,480
7Oct 9, 2026 16:232,55330,036,81220,937,000020,480
8Oct 9, 2026 16:232,56729,958,64019,998,0001,054,00020,480
9Oct 9, 2026 16:232,57530,696,41021,117,000020,480