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 17, 2023 23:29Ulyanov AlekseyUlyanov AlekseyScore: 16,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2023 23:2916,343192,485,167134,013,07602,260,992
2Jun 17, 2023 23:2916,375202,734,544134,271,65702,252,800
3Jun 17, 2023 23:2916,567205,487,022135,847,25202,256,896