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:02Andrey TsvetkovAndrey TsvetkovScore: 113,703Success
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:0285,008762,058,452697,063,45002,310,144
2Jun 20, 2021 14:0294,275833,231,522773,051,07102,301,952
3Jun 20, 2021 14:02104,584913,741,290857,589,16802,293,760
4Jun 20, 2021 14:02113,703994,068,199932,368,47802,293,760
5Jun 20, 2021 14:02114,133993,453,685935,889,82802,297,856
6Jun 20, 2021 14:02117,3231,022,067,832962,046,49602,289,664