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 23:37zielajzielajError
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 23:3700000Error: Exit with code 1: not a dynamic executable 2004318071 2290649223 2075430529 2290649223 0 4294967295 50000000 100000000 2075430529 2290649223 43957925 6300577 2075430529 2290649223 6042075 6300608 2267470237 2296166061 5677397 623180stderr
2Oct 14, 2024 23:3800000Error: Exit with code 1: not a dynamic executable 2004318071 2290649223 965651651 2290649223 0 4294967295 50000000 100000000 965651651 2290649223 36653021 19550167 965651651 2290649223 13346979 19550208 1781897846 1958564188 9322898 1836511stderr