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 20, 2021 13:17Andrey TsvetkovAndrey TsvetkovScore: 97,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 13:1794,346841,369,889773,640,18602,293,760
2Jun 20, 2021 13:1894,368829,914,295773,820,03602,199,552
3Jun 20, 2021 13:1896,122859,796,677788,196,75902,293,760
4Jun 20, 2021 13:1797,907858,389,912802,836,61902,310,144
5Jun 20, 2021 13:18113,243996,452,741928,593,12602,293,760
6Jun 20, 2021 13:17121,0951,057,299,076992,976,18302,310,144