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 listAug 2, 2024 19:59Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:47Victor Mercklé22.24CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:47087,890,30175,610,0001,029,00024,576Exit with code 101: 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_BACKTRACE=1` environment variabl...stderr
2Aug 2, 2024 19:593,42395,669,08528,067,67902,260,992
3Aug 2, 2024 19:593,45295,080,33628,303,85702,281,472
4Aug 2, 2024 19:593,47699,618,92828,500,62302,220,032