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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:3708,804,2301,073,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 18:193,30648,273,13326,105,0001,004,0002,347,008
3Oct 19, 2024 18:193,31245,236,59325,148,0002,011,0002,285,568
4Oct 19, 2024 18:193,31550,208,43826,173,0001,006,0002,392,064