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 4, 2023 00:00Mikhail ShirokovMikhail ShirokovScore: 1,345,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2023 00:001,296,82510,711,127,45810,633,965,77502,277,376
2Sep 4, 2023 00:001,345,75711,092,902,04111,035,204,60602,265,088
3Sep 4, 2023 00:001,409,32611,613,541,15611,556,476,25502,260,992