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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:26013,515,1293,171,0001,034,00020,480No answer to stdout. Died or killed?
2Oct 16, 2024 23:453,64251,895,85027,877,0001,991,0002,379,776
3Oct 16, 2024 23:453,66757,344,32428,067,0002,004,0002,457,600
4Oct 16, 2024 23:453,67451,666,88727,111,0003,012,0002,297,856