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 28, 2021 18:15alex3dalex3dScore: 183,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 18:24171,3371,471,891,5201,404,962,59802,281,472
2Jun 28, 2021 18:21173,9711,487,619,7861,426,560,44502,285,568
3Jun 28, 2021 18:21178,6911,530,370,5961,465,263,67902,289,664
4Jun 28, 2021 18:15181,4711,545,430,0621,488,061,88702,301,952
5Jun 28, 2021 18:24183,0361,559,497,7311,500,891,48702,289,664
6Jun 28, 2021 18:24187,1821,604,441,6831,534,894,40802,289,664
7Jun 28, 2021 18:15190,8981,617,272,2971,565,362,46902,289,664
8Jun 28, 2021 18:15191,5191,633,913,3901,570,454,00202,293,760
9Jun 28, 2021 18:21194,7571,656,619,8791,597,011,31602,281,472