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 19, 2024 18:29zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 18:2900000Error: Exit with code 1: not a dynamic executable 67760 30545 33639 2263062187 757584 377174 384153 2252335721 2252335721 3000000 2249335721 2255335721 99999744 100000000 2249335721 2255335721 50000000 100000000 2249335721 2255335721 49802673 137395 2...stderr
2Oct 19, 2024 18:2900000Error: Exit with code 1: not a dynamic executable 67760 33009 36090 2104023732 757584 374119 381045 2111011892 2111011892 3000000 2108011892 2114011892 99999744 100000000 2108011892 2114011892 50000000 100000000 2108011892 2114011892 50018715 134557 2...stderr