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:56Andrey TsvetkovAndrey TsvetkovScore: 100,979Success
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 13:5782,135736,488,838673,509,27302,289,664
2Jun 20, 2021 13:5686,594776,174,399710,071,15602,306,048
3Jun 20, 2021 13:5791,411805,470,375749,568,62402,293,760
4Jun 20, 2021 13:56100,979887,366,175828,025,70002,297,856
5Jun 20, 2021 13:56108,157945,895,516886,886,61702,310,144
6Jun 20, 2021 13:57108,163948,026,232886,934,80602,289,664