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:12Andrey 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:1200000Error: Exit with code 101: seek: 968ns mmap: 1.144401ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 18446744073709540142 greater than length of slice 100855 ...stderr
2Jun 24, 2024 16:1200000Error: Exit with code 101: seek: 916ns mmap: 1.140178ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 120139 greater than length of slice 97565 note: run with ...stderr
3Jun 24, 2024 16:133,98491,035,09032,672,36902,203,648
4Jun 24, 2024 16:133,994100,526,91732,752,28602,236,416
5Jun 24, 2024 16:134,01699,433,77832,934,40502,318,336