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:52Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:43057,887,79147,390,0001,052,00024,576Exit with code 101: seek: 1.14µs mmap: 220.592µ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:523,919103,282,53932,138,12302,199,552
3Jun 24, 2024 15:523,93999,539,85632,298,93602,306,048
4Jun 24, 2024 15:523,95088,334,05032,390,18602,306,048