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:34Ulyanov AlekseyUlyanov AlekseyScore: 16,498Success
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:3416,442249,323,236134,825,67502,256,896
2Jun 17, 2023 23:3416,447205,080,879134,867,83902,240,512
3Jun 17, 2023 23:3416,468218,844,036135,037,07402,240,512
4Jun 17, 2023 23:3416,498206,678,952135,284,18302,252,800
5Jun 17, 2023 23:3416,503196,608,365135,322,10502,252,800
6Jun 17, 2023 23:3416,525219,287,087135,507,89802,244,608