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:58Yurkov AlekseyYurkov AlekseyScore: 97,223Success
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:5863,244582,522,587518,599,32202,293,760
2Jun 13, 2021 17:5876,834691,700,485630,040,35502,293,760
3Jun 13, 2021 17:5884,338751,827,566691,574,67502,297,856
4Jun 13, 2021 17:5887,119780,055,416714,373,87502,301,952
5Jun 13, 2021 17:5897,223869,686,839797,225,48102,289,664
6Jun 13, 2021 17:5899,943877,772,560819,534,67102,297,856
7Jun 13, 2021 17:58101,756896,845,893834,398,62802,297,856
8Jun 13, 2021 17:58111,329988,605,273912,900,90202,297,856
9Jun 13, 2021 17:58116,6391,013,588,118956,443,87102,301,952