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 27, 2021 07:16gchebanovgchebanovScore: 32,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 07:1631,532324,193,270258,562,90202,236,416
2Jun 27, 2021 07:1632,647342,425,358267,702,51302,244,608
3Jun 27, 2021 07:1633,442353,189,887274,227,70102,244,608