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 listNov 27, 2022 14:57Vlad ShcherbinaVlad ShcherbinaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 14:5700000Error: Exit with code 101: 4062272 mmap [main.rs:20] left_cnt = 53780369 [main.rs:21] right_cnt = 43760191 [main.rs:22] xs.len() = 2459440 thread 'main' panicked at 'partition_at_index index 18446744073705771247 greater than length of slice 2459440', ...stderr