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 11, 2021 19:51Yuriy LyfenkoYuriy LyfenkoScore: 107,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 19:5293,881825,457,132769,823,72402,301,952
2Jun 11, 2021 19:5294,572832,198,674775,490,47302,310,144
3Jun 11, 2021 19:5199,496884,728,628815,870,16902,297,856
4Jun 11, 2021 19:51107,876946,224,475884,579,77702,191,360
5Jun 11, 2021 19:51114,055994,392,680935,251,38102,306,048
6Jun 11, 2021 19:52120,0381,059,109,361984,310,42302,297,856