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 listAug 3, 2021 15:48Mikhail ShirokovMikhail ShirokovScore: 22,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2021 15:4822,013239,255,443180,509,19902,306,048
2Aug 3, 2021 15:4822,035233,298,375180,687,70702,244,608
3Aug 3, 2021 15:4822,138240,283,357181,531,59102,256,896