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 listJul 16, 2023 06:140xprames0xpramesScore: 957,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 06:14956,8517,909,228,2097,846,174,45502,281,472
2Jul 16, 2023 06:14957,2767,922,438,8817,849,666,18402,293,760
3Jul 16, 2023 06:14964,1007,957,767,7957,905,619,31602,285,568