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:39Yurkov AlekseyYurkov AlekseyScore: 84,103Success
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:3966,410608,028,550544,566,00102,293,760
2Jun 13, 2021 15:3984,103756,679,372689,641,78902,285,568
3Jun 13, 2021 15:39109,008964,855,511893,868,52602,297,856