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 16, 2024 01:19zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:23010,094,5512,359,000024,576No answer to stdout. Died or killed?stderr
2Oct 16, 2024 01:193,61054,636,99827,565,0002,041,0002,359,296
3Oct 16, 2024 01:193,64163,866,20727,863,0001,990,0002,371,584
4Oct 16, 2024 01:193,65257,361,32127,953,0001,996,0002,428,928