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 listOct 13, 2021 10:16Mikhail ShirokovMikhail ShirokovScore: 22,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 10:1621,856248,444,985179,222,30902,256,896
2Oct 13, 2021 10:1622,184245,392,987181,912,56502,265,088
3Oct 13, 2021 10:1622,433251,621,798183,953,29902,260,992