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:01Dmitry DolgopolovDmitry DolgopolovScore: 254,352Success
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:1015,935205,798,389130,670,83802,277,376
2Jun 19, 2021 10:1091,408804,022,796749,544,13002,265,088
3Jun 19, 2021 10:10101,807906,366,668834,813,72602,269,184
4Jun 19, 2021 10:10107,742938,908,033883,488,15502,273,280
5Jun 19, 2021 10:10118,6961,034,694,175973,303,27702,269,184
6Jun 19, 2021 10:01219,7101,867,897,9711,801,621,36302,277,376
7Jun 19, 2021 10:10254,3522,142,585,9932,085,685,54702,252,800
8Jun 19, 2021 10:10360,0583,019,332,2402,952,473,13102,273,280
9Jun 19, 2021 10:10444,7593,716,007,1013,647,026,40002,273,280
10Jun 19, 2021 10:01507,4564,232,571,9004,161,142,44502,277,376
11Jun 19, 2021 10:10723,8606,001,268,6205,935,650,74102,273,280
12Jun 19, 2021 10:01745,2446,174,089,4976,110,999,08902,273,280