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 07:15gchebanovgchebanovScore: 117,208Success
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 07:1593,017821,914,876762,736,34602,273,280
2Jun 27, 2021 07:15117,2081,024,528,710961,103,66002,269,184
3Jun 27, 2021 07:15122,5751,087,958,9541,005,111,04902,260,992