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 listMar 1, 2023 00:52Franek KortaFranek KortaScore: 969,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2023 00:52963,9127,963,058,9227,904,080,24802,293,760
2Mar 1, 2023 00:53965,2227,979,163,4767,914,823,38402,285,568
3Mar 1, 2023 00:44965,7517,981,777,6637,919,161,07702,293,760
4Mar 1, 2023 00:53968,1868,012,823,9037,939,125,04502,281,472
5Mar 1, 2023 00:44969,6608,013,202,7807,951,211,85802,285,568
6Mar 1, 2023 00:52969,6768,006,981,6507,951,345,72202,293,760
7Mar 1, 2023 00:44969,7908,019,402,0777,952,280,12102,277,376
8Mar 1, 2023 00:52970,6108,028,775,9537,958,999,05802,285,568
9Mar 1, 2023 00:53970,7748,018,589,8137,960,350,66802,281,472