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

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:57Andrew Epstein20.77CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:0009,780,1771,139,000024,576Exit with code 1: 160000 106121 119819 106121 119819 1184715361stderr
2Oct 16, 2024 01:043,98759,499,26030,647,0002,043,0002,297,856
3Oct 16, 2024 01:044,03354,415,87928,061,0005,010,0002,338,816
4Oct 16, 2024 01:044,03754,874,00828,090,0005,016,0002,445,312
5Oct 16, 2024 01:044,03855,844,25628,094,0005,016,0002,363,392
6Oct 16, 2024 01:044,04754,779,65028,159,0005,028,0002,289,664
7Oct 16, 2024 01:044,05052,540,43229,188,0004,026,0002,486,272
8Oct 16, 2024 01:044,05056,515,71126,169,0007,045,0002,306,048
9Oct 16, 2024 01:044,14466,566,49125,988,0007,996,0002,441,216
10Oct 16, 2024 01:044,15356,692,99930,050,0004,006,0002,326,528