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:06gchebanovgchebanovScore: 32,112Success
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:0631,830334,546,959261,005,46902,244,608
2Jun 27, 2021 17:0632,112326,884,070263,321,59502,232,320
3Jun 27, 2021 17:0633,087327,213,658271,311,04302,232,320