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 19, 2021 10:08Dmitry DolgopolovDmitry DolgopolovScore: 57,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 10:0820,722237,741,512169,917,65002,265,088
2Jun 19, 2021 10:0838,204383,866,442313,274,72902,297,856
3Jun 19, 2021 10:0839,811386,507,253326,447,25902,170,880
4Jun 19, 2021 10:0855,664514,083,142456,444,31402,183,168
5Jun 19, 2021 10:0255,807519,118,491457,615,80202,174,976
6Jun 19, 2021 10:0855,835513,471,060457,846,98502,281,472
7Jun 19, 2021 10:0857,126541,470,899468,436,82002,289,664
8Jun 19, 2021 10:0273,633673,161,016603,792,69502,174,976
9Jun 19, 2021 10:0874,310679,591,798609,343,06202,174,976
10Jun 19, 2021 10:08108,729951,686,962891,576,58002,293,760
11Jun 19, 2021 10:02142,0741,227,242,8271,165,007,87802,183,168
12Jun 19, 2021 10:08144,2241,245,074,4541,182,633,83102,174,976