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 13:51Yuriy LyfenkoYuriy LyfenkoScore: 1,005,274Success
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 13:51992,1658,196,232,1658,135,756,70502,306,048
2Jun 12, 2021 13:511,005,2748,306,485,3468,243,244,59102,293,760
3Jun 12, 2021 13:511,008,6508,357,242,0308,270,933,20702,301,952