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 14, 2021 20:06Mikhail ShirokovMikhail ShirokovScore: 95,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2021 20:0684,883757,420,214696,036,72202,293,760
2Jun 14, 2021 20:0695,785855,061,630785,438,00502,228,224
3Jun 14, 2021 20:0699,670876,584,528817,294,25402,285,568