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 listMay 1, 2026 16:30Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 13:02Tomislav Tunkovic131.36CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 13:10033,702,30117,612,0004,938,00016,384No answer to stdout. Died or killed?
2May 1, 2026 16:314,48055,885,10433,763,0002,979,0002,371,584
3May 1, 2026 16:314,50250,843,08435,920,000997,0002,469,888
4May 1, 2026 16:314,50957,934,11534,981,0001,998,0002,486,272
5May 1, 2026 16:314,51551,932,47635,024,0002,001,0002,363,392
6May 1, 2026 16:314,52254,173,09633,078,0004,009,0002,416,640
7May 1, 2026 16:314,53551,674,64335,185,0002,010,0002,301,952
8May 1, 2026 16:314,54455,593,78035,254,0002,014,0002,428,928
9May 1, 2026 16:314,58655,996,24835,578,0002,033,0002,465,792
10May 1, 2026 16:314,61560,029,19034,861,0002,988,0002,478,080