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:07Dmitry DolgopolovDmitry DolgopolovScore: 66,997Success
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:0326,181284,106,852214,681,26302,195,456
2Jun 19, 2021 10:0726,943281,499,705220,931,59202,297,856
3Jun 19, 2021 10:0727,357290,902,874224,325,75002,297,856
4Jun 19, 2021 10:0727,779296,848,925227,787,65502,183,168
5Jun 19, 2021 10:0745,813426,039,326375,668,72002,170,880
6Jun 19, 2021 10:0347,954452,574,614393,225,61702,297,856
7Jun 19, 2021 10:0766,997608,594,166549,372,17202,179,072
8Jun 19, 2021 10:0770,085638,383,086574,694,76402,174,976
9Jun 19, 2021 10:0786,431765,767,038708,730,24002,170,880
10Jun 19, 2021 10:0787,540778,114,438717,829,60002,174,976
11Jun 19, 2021 10:0388,747785,063,189727,724,91802,297,856
12Jun 19, 2021 10:07108,190946,379,383887,157,59802,174,976