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 listAug 3, 2021 15:22Mikhail ShirokovMikhail ShirokovScore: 25,123Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2021 14:4624,618257,592,128201,869,24302,256,896
2Aug 3, 2021 15:2224,715263,598,902202,659,18602,248,704
3Aug 3, 2021 14:4624,998279,789,490204,981,36502,244,608
4Aug 3, 2021 14:4625,123264,847,537206,010,26402,248,704
5Aug 3, 2021 15:2225,837283,470,195211,863,65602,248,704
6Aug 3, 2021 15:2225,906271,677,789212,429,58902,256,896