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 20, 2021 14:08Andrey TsvetkovAndrey TsvetkovScore: 106,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 14:0776,357707,244,762626,127,71802,252,800
2Jun 20, 2021 14:0796,477853,768,663791,113,85202,240,512
3Jun 20, 2021 14:07105,644934,659,933866,280,81002,269,184
4Jun 20, 2021 14:08106,604947,317,367874,154,75202,285,568
5Jun 20, 2021 14:08113,9581,003,564,064934,452,37802,252,800
6Jun 20, 2021 14:08121,3141,054,239,782994,774,61602,183,168