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 5, 2022 10:57Eugene ZhydzetskiEugene ZhydzetskiScore: 24,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2022 10:5723,976252,826,268196,607,02502,179,072
2Sep 5, 2022 10:5724,274270,097,713199,050,73902,199,552
3Sep 5, 2022 10:5724,376271,101,932199,883,13702,187,264