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 16:02Andrey 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 16:0200000Error: Exit with code 101: seek: 879ns mmap: 1.153989ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 46328613 greater than length of slice 197561 note: run wi...stderr
2Jun 24, 2024 16:0300000Error: Exit with code 101: seek: 899ns mmap: 1.139532ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 18446744073664378156 greater than length of slice 210049 ...stderr
3Jun 24, 2024 16:0300000Error: Exit with code 101: seek: 958ns mmap: 1.138388ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 48777073 greater than length of slice 237626 note: run wi...stderr