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 07:17Andrey 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 07:1700000Error: Exit with code 101: seek: 801ns mmap: 1.14048ms lower: 2091909120/499363 upper: 2097152000/500622 127645 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 1...stderr
2Jun 24, 2024 07:183,930103,799,00332,225,38702,318,336
3Jun 24, 2024 07:183,95194,799,59932,397,63402,301,952
4Jun 24, 2024 07:183,98399,463,36332,658,16502,240,512