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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:2608,885,0601,147,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 19:153,13648,339,14325,713,00002,371,584
3Oct 19, 2024 19:153,15250,710,57723,861,0001,988,0002,519,040
4Oct 19, 2024 19:153,24254,545,29724,543,0002,045,0002,428,928