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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2024 15:5600000Error: Exit with code 101: seek: 961ns mmap: 1.144735ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 29155 greater than length of slice 22944 note: run with `...stderr
2Jun 24, 2024 15:5700000Error: Exit with code 101: seek: 908ns mmap: 1.146248ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 76332 greater than length of slice 49020 note: run with `...stderr
3Jun 24, 2024 15:5700000Error: Exit with code 101: seek: 1.777µs mmap: 1.140922ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 44718 greater than length of slice 43395 note: run wit...stderr