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 14:06Andrey TsvetkovAndrey TsvetkovScore: 100,157Success
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:0680,335718,545,498658,749,76902,277,376
2Jun 20, 2021 14:0691,580806,869,393750,955,33402,252,800
3Jun 20, 2021 14:0696,425862,245,599790,687,70402,289,664
4Jun 20, 2021 14:06100,157879,478,226821,285,45302,260,992
5Jun 20, 2021 14:06108,835956,345,125892,450,76602,260,992
6Jun 20, 2021 14:06122,7011,066,148,6701,006,151,60602,260,992