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 listOct 14, 2024 00:27zielajzielajScore: 9,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:279,14197,508,56065,965,0008,995,0002,355,200
2Oct 14, 2024 00:279,285103,480,72163,117,00013,024,0002,293,760
3Oct 14, 2024 00:279,360101,176,81862,797,00013,955,0002,338,816