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 29, 2021 20:24alex3dalex3dScore: 177,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 20:24168,6191,452,050,0701,382,676,00802,293,760
2Jun 29, 2021 20:24177,3721,514,257,8941,454,452,61102,301,952
3Jun 29, 2021 20:24183,0061,566,678,1691,500,650,11802,289,664