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 listFeb 20, 2024 14:18Huy Duc LeHuy Duc LeScore: 30,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2024 14:1830,127311,754,175247,043,57702,252,800
2Feb 20, 2024 14:1830,455311,412,842249,728,46802,248,704
3Feb 20, 2024 14:1835,366354,587,310289,997,50802,301,952