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 27, 2021 17:18gchebanovgchebanovScore: 30,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 17:1829,638315,445,380243,030,03102,236,416
2Jun 27, 2021 17:1830,184309,691,116247,510,55502,224,128
3Jun 27, 2021 17:1830,593321,280,306250,861,45902,228,224