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 13:37alex3dalex3dScore: 107,915Success
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 13:3988,938796,835,049729,294,96602,301,952
2Jun 19, 2021 13:3795,663846,489,680784,436,07402,301,952
3Jun 19, 2021 13:3597,295848,600,627797,818,75102,306,048
4Jun 19, 2021 13:35100,944886,279,083827,741,55102,289,664
5Jun 19, 2021 13:39107,915946,081,276884,902,67902,301,952
6Jun 19, 2021 13:37113,415984,593,673930,003,40502,297,856
7Jun 19, 2021 13:39116,3861,008,970,931954,364,03702,297,856
8Jun 19, 2021 13:35128,5511,108,216,3621,054,114,80702,297,856
9Jun 19, 2021 13:37130,9541,134,470,2371,073,822,28802,301,952