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 13, 2021 20:02Sergey StreminSergey StreminError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 20:0200000Error: Exit with code 101: hist time 56 ms index time 0 ms min-max time 0 ms vec time 48 ms thread 'main' panicked at 'assertion failed: `(left == right)` left: `782080`, right: `100000000`', main.rs:56:5 note: run with `RUST_BACKTRACE=1` environmen...stderr