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 3, 2021 14:45Mikhail ShirokovMikhail ShirokovScore: 25,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2021 14:4524,738273,173,855202,848,26802,252,800
2Aug 3, 2021 14:4525,224273,078,793206,837,62002,248,704
3Aug 3, 2021 14:4525,322277,254,019207,644,27702,252,800