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 12, 2021 14:39Yuriy LyfenkoYuriy LyfenkoScore: 130,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 14:39103,376905,441,747847,679,81302,306,048
2Jun 12, 2021 14:39130,8921,140,851,3641,073,318,07102,293,760
3Jun 12, 2021 14:39133,3981,158,420,9811,093,867,46502,289,664