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 listSep 3, 2021 15:56Ilya AniskovetsIlya AniskovetsScore: 960,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 15:56953,9447,895,742,1317,822,344,64002,281,472
2Sep 3, 2021 15:56960,5007,940,958,8507,876,102,88602,281,472
3Sep 3, 2021 15:56962,4427,951,598,4097,892,027,71502,289,664