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 listAug 21, 2024 14:02GabriellaGabriellaScore: 189,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 14:02188,7581,614,879,8141,547,816,84302,289,664
2Aug 21, 2024 14:02189,4521,619,179,5431,553,505,30502,297,856
3Aug 21, 2024 14:02190,1581,615,622,5841,559,293,17402,289,664