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 18:18gchebanovgchebanovScore: 31,625Success
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 18:1831,479317,757,170258,129,24402,232,320
2Jun 27, 2021 18:1831,625325,395,890259,325,01802,228,224
3Jun 27, 2021 18:1833,584333,722,992275,387,78402,232,320