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 listJun 24, 2024 15:23Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:41Victor Mercklé39.33CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:42054,680,87244,065,0001,104,00024,576Exit with code 101: seek: 1.14µs mmap: 224.622µs thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 50000000 greater than length of slice 0 note: run with `RUST_B...stderr
2Jun 24, 2024 15:233,89799,264,74131,956,16602,215,936
3Jun 24, 2024 15:233,92999,570,22332,221,18102,293,760
4Jun 24, 2024 15:233,94699,283,23332,353,28102,187,264