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 listJan 18, 2026 06:17Josu San MartinJosu San MartinScore: 8,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:178,14195,243,85564,764,0001,992,0002,453,504
2Jan 18, 2026 06:178,15194,241,29765,844,000997,0002,437,120
3Jan 18, 2026 06:178,15294,003,00864,853,0001,995,0002,461,696
4Jan 18, 2026 06:178,16395,397,11265,939,000999,0002,461,696
5Jan 18, 2026 06:178,17588,983,35765,031,0002,000,0002,351,104
6Jan 18, 2026 06:178,17789,612,40865,049,0002,001,0002,355,200
7Jan 18, 2026 06:178,18596,767,74165,110,0002,003,0002,457,600
8Jan 18, 2026 06:178,18889,440,90565,138,0002,004,0002,461,696
9Jan 18, 2026 06:178,26297,688,12065,759,0001,992,0002,457,600