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 listAug 28, 2023 23:39Mikhail ShirokovMikhail ShirokovScore: 21,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 23:3921,735242,786,001178,228,44902,273,280
2Aug 28, 2023 23:3921,867244,422,336179,307,19002,256,896
3Aug 28, 2023 23:3922,124241,890,774181,416,77902,183,168