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 listJun 13, 2021 17:55Yurkov AlekseyYurkov AlekseyScore: 74,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 17:5565,571617,741,190537,679,57902,297,856
2Jun 13, 2021 17:5565,918615,387,000540,524,38902,293,760
3Jun 13, 2021 17:5567,706614,676,882555,191,66702,174,976
4Jun 13, 2021 17:5569,444623,623,022569,438,73502,301,952
5Jun 13, 2021 17:5574,451681,407,382610,500,01002,293,760
6Jun 13, 2021 17:5589,482792,023,827733,751,74002,289,664
7Jun 13, 2021 17:5590,269813,776,844740,206,57902,289,664
8Jun 13, 2021 17:5594,350842,545,081773,666,60202,285,568
9Jun 13, 2021 17:5599,691880,303,275817,470,29802,297,856