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:39Andrey TsvetkovAndrey TsvetkovScore: 152,065Success
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:3988,131777,551,956722,677,12802,215,936
2Jun 20, 2021 13:3797,488858,950,473799,403,86502,207,744
3Jun 20, 2021 13:35103,4361,091,294,744848,173,89502,260,992
4Jun 20, 2021 13:37109,783957,251,680900,220,09602,297,856
5Jun 20, 2021 13:35111,067972,525,579910,752,70602,289,664
6Jun 20, 2021 13:39115,5921,013,686,710947,856,40002,289,664
7Jun 20, 2021 13:35152,0652,832,060,2621,246,933,90202,371,584
8Jun 20, 2021 13:39157,7393,767,361,7881,293,457,35202,252,800
9Jun 20, 2021 13:37183,4544,926,495,3811,504,325,93302,240,512
10Jun 20, 2021 13:39212,3316,365,152,3381,741,118,05002,179,072
11Jun 20, 2021 13:39237,8848,029,224,3221,950,652,00502,248,704
12Jun 20, 2021 13:39267,6909,582,285,4382,195,061,58302,306,048