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 21, 2024 10:34Huy Duc LeHuy Duc LeScore: 6,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 10:346,589121,545,43754,026,33002,199,552
2Feb 21, 2024 10:346,841128,542,64256,097,41202,310,144
3Feb 21, 2024 10:347,017127,246,09657,539,55502,215,936