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 3, 2026 01:34Karthik ReddyKarthik ReddyScore: 2,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:352,50129,612,11720,513,000020,480
2Oct 3, 2026 01:352,51429,587,50419,490,0001,130,00020,480
3Oct 3, 2026 01:352,53529,896,74120,790,000020,480
4Oct 3, 2026 01:352,55730,003,43619,943,0001,026,00020,480
5Oct 3, 2026 01:352,62930,572,38420,173,0001,390,00020,480
6Oct 3, 2026 01:352,68431,036,97620,223,0001,789,00020,480
7Oct 3, 2026 01:352,69931,198,50920,386,0001,751,00020,480
8Oct 3, 2026 01:352,71531,244,34219,637,0002,630,00020,480
9Oct 3, 2026 01:352,80232,347,31919,597,0003,382,00020,480