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 30, 2023 18:54apuxbtapuxbtScore: 20,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 18:5420,508229,767,324168,165,80402,220,032
2Sep 30, 2023 18:5420,658230,780,686169,397,49702,211,840
3Sep 30, 2023 18:5420,756252,866,090170,195,42302,215,936