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 listJul 4, 2021 01:21Egor SergeevEgor SergeevScore: 84,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2021 01:2181,794746,715,744670,709,01402,260,992
2Jul 4, 2021 01:2184,733768,849,345694,806,68602,277,376
3Jul 4, 2021 01:2184,797758,581,937695,332,01902,273,280