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:05Dmitry DolgopolovDmitry DolgopolovScore: 65,271Success
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:0534,454344,561,291282,522,33902,293,760
2Jun 19, 2021 10:0534,756341,244,473284,996,37802,301,952
3Jun 19, 2021 10:0635,898346,680,276294,360,33702,174,976
4Jun 19, 2021 10:0337,452364,557,539307,108,98002,301,952
5Jun 19, 2021 10:0337,950362,168,040311,192,14202,174,976
6Jun 19, 2021 10:0662,263575,177,843510,556,21002,174,976
7Jun 19, 2021 10:0365,271597,237,567535,226,06502,289,664
8Jun 19, 2021 10:0583,555740,998,324685,149,17402,174,976
9Jun 19, 2021 10:0685,152751,791,788698,249,28602,301,952
10Jun 19, 2021 10:0586,504777,600,380709,336,39302,297,856
11Jun 19, 2021 10:0587,209789,336,797715,116,03102,179,072
12Jun 19, 2021 10:0587,722777,431,726719,322,63202,273,280