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 listDec 17, 2023 22:25Yurkov AlekseyYurkov AlekseyScore: 46,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2023 22:2645,204436,106,753370,675,70502,297,856
2Dec 17, 2023 22:2545,349425,422,097371,864,51402,289,664
3Dec 17, 2023 22:2645,732438,185,697375,005,04602,293,760
4Dec 17, 2023 22:2546,036448,780,353377,492,66702,285,568
5Dec 17, 2023 22:2646,053440,076,132377,633,46102,289,664
6Dec 17, 2023 22:2546,952455,265,264385,007,84702,285,568