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 listMay 7, 2026 20:31Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:31053,565,24231,847,0008,028,000405,504Exit with code 101: thread 'main' (1) panicked at main.rs:175:9: assertion failed: 50000000 - less < i note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 7, 2026 20:315,56059,504,89137,753,0007,843,0002,498,560
3May 7, 2026 20:315,59260,630,92137,925,0007,931,0002,547,712
4May 7, 2026 20:315,66263,655,76538,253,0008,178,0002,473,984
5May 7, 2026 20:315,87666,333,29339,129,0009,062,0002,547,712
6May 7, 2026 20:315,91664,844,19239,215,0009,302,0002,473,984
7May 7, 2026 20:316,01964,315,47740,173,0009,184,0002,494,464