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 listMar 4, 2026 15:17olliecrowolliecrowScore: 12,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:1712,120126,584,59798,377,0001,003,0002,424,832
2Mar 4, 2026 15:1712,129119,909,70298,454,0001,004,0002,424,832
3Mar 4, 2026 15:1712,131127,567,89697,469,0002,009,0002,412,544
4Mar 4, 2026 15:1712,143125,754,81298,566,0001,005,0002,416,640
5Mar 4, 2026 15:1712,143126,284,51198,569,0001,005,0002,445,312
6Mar 4, 2026 15:1712,153128,908,05697,658,0001,993,0002,396,160
7Mar 4, 2026 15:1712,161128,353,37399,720,00002,457,600
8Mar 4, 2026 15:1712,167126,169,65598,772,000997,0002,420,736
9Mar 4, 2026 15:1712,182125,661,98897,896,0001,997,0002,412,544