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 15:15Yurkov AlekseyYurkov AlekseyScore: 91,902Success
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 15:1588,788794,852,643728,059,85602,285,568
2Jun 13, 2021 15:1591,902826,158,093753,594,92902,293,760
3Jun 13, 2021 15:15112,412986,957,278921,778,81702,301,952