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 14, 2024 01:22zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:38Andrew Epstein10.72CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 20:39049,877,03431,457,0009,337,00020,480Exit with code 1: 0 4294967295 50000000 100000000 2004318071 2290649223 25002108 8591186stderr
2Oct 14, 2024 01:224,98067,068,69830,875,0009,959,0002,297,856
3Oct 14, 2024 01:225,10863,699,67428,922,00012,965,0002,289,664
4Oct 14, 2024 01:225,25670,982,38530,070,00013,030,0002,289,664