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 12, 2021 08:50Dmitry DolgopolovDmitry DolgopolovScore: 107,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 08:5890,277806,647,158740,271,38702,207,744
2Jun 12, 2021 08:50101,365885,715,148831,194,86802,211,840
3Jun 12, 2021 08:51103,438919,641,178848,189,78502,211,840
4Jun 12, 2021 09:20104,030913,035,572853,044,53802,220,032
5Jun 12, 2021 09:20105,004920,876,894861,034,83702,211,840
6Jun 12, 2021 08:51105,444935,958,712864,637,31402,203,648
7Jun 12, 2021 08:58107,623943,053,156882,507,21902,211,840
8Jun 12, 2021 08:50107,805954,159,871884,002,75902,207,744
9Jun 12, 2021 09:20109,498961,603,497897,881,54002,203,648
10Jun 12, 2021 08:51112,727993,516,958924,363,81902,211,840
11Jun 12, 2021 08:58116,9041,014,004,012958,608,90102,207,744
12Jun 12, 2021 08:50127,4471,114,190,2591,045,063,20802,211,840