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 20, 2024 02:25zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:2108,790,6101,075,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 02:253,01153,170,55723,659,0001,028,0002,306,048
3Oct 20, 2024 02:253,03850,576,33523,914,000996,0002,338,816
4Oct 20, 2024 02:253,05350,815,36322,029,0003,003,0002,416,640