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:53Yuriy LyfenkoYuriy LyfenkoScore: 103,469Success
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:5386,584760,341,567709,992,01402,301,952
2Jun 11, 2021 19:5395,875863,787,474786,174,07902,301,952
3Jun 11, 2021 19:5398,652873,991,033808,949,91402,297,856
4Jun 11, 2021 19:5299,812876,991,956818,462,14702,306,048
5Jun 11, 2021 19:52103,469908,138,236848,444,26502,293,760
6Jun 11, 2021 19:53104,629913,679,960857,954,57802,297,856
7Jun 11, 2021 19:53117,2841,025,942,377961,726,76702,301,952
8Jun 11, 2021 19:52118,1851,028,265,666969,120,73002,306,048
9Jun 11, 2021 19:53118,9551,042,268,692975,431,58502,301,952