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 listSep 3, 2023 23:40Mikhail ShirokovMikhail ShirokovScore: 1,400,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 23:401,289,74010,645,870,64110,575,867,91902,260,992
2Sep 3, 2023 23:401,400,28811,550,451,34411,482,365,48302,265,088
3Sep 3, 2023 23:401,438,28311,866,289,37111,793,920,82702,273,280