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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:49010,389,0602,371,000020,480No answer to stdout. Died or killed?
2Oct 16, 2024 01:413,43949,728,21126,187,0002,014,0002,490,368
3Oct 16, 2024 01:413,45653,912,38925,303,0003,036,0002,469,888
4Oct 16, 2024 01:413,47850,133,01327,504,0001,018,0002,363,392