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 20:14alex3dalex3dScore: 114,189Success
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 20:21109,074960,462,656894,407,51702,273,280
2Jun 19, 2021 20:14109,117955,298,189894,758,65702,273,280
3Jun 19, 2021 20:21113,507989,417,985930,759,38102,273,280
4Jun 19, 2021 20:18114,1021,002,555,816935,635,06202,293,760
5Jun 19, 2021 20:18114,189995,540,891936,349,57402,281,472
6Jun 19, 2021 20:14117,0411,023,377,681959,735,62702,285,568
7Jun 19, 2021 20:21125,8541,100,772,0611,032,001,21102,273,280
8Jun 19, 2021 20:14126,9091,109,867,5291,040,651,92002,269,184
9Jun 19, 2021 20:18133,8741,156,584,1351,097,765,84602,281,472