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 19, 2024 18:12zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:59Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:0008,760,3111,045,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 18:123,52150,019,28726,882,0001,991,0002,441,216
3Oct 19, 2024 18:123,53651,239,63127,996,000999,0002,392,064
4Oct 19, 2024 18:123,57350,028,12925,261,0004,041,0002,473,984