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 20, 2021 13:59Andrey TsvetkovAndrey TsvetkovScore: 118,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 14:0192,075822,031,508755,016,44502,281,472
2Jun 20, 2021 13:59107,220936,266,789879,202,41802,293,760
3Jun 20, 2021 14:01107,853939,442,861884,391,08102,310,144
4Jun 20, 2021 13:59118,4881,039,891,230971,599,35602,285,568
5Jun 20, 2021 14:01119,8231,038,443,601982,551,75802,297,856
6Jun 20, 2021 13:59120,2281,048,288,382985,866,09302,285,568