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:24zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:18Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:18010,237,0332,313,000024,576No answer to stdout. Died or killed?stderr
2Oct 16, 2024 01:243,60856,223,33827,543,0002,040,0002,437,120
3Oct 16, 2024 01:243,60954,957,52329,594,00002,281,472
4Oct 16, 2024 01:243,64160,359,38427,867,0001,990,0002,281,472