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 listSep 3, 2023 23:42Mikhail ShirokovMikhail ShirokovScore: 1,395,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 23:421,335,34011,005,728,18710,949,790,39702,260,992
2Sep 3, 2023 23:421,395,22111,504,956,76211,440,811,02802,256,896
3Sep 3, 2023 23:421,466,10012,087,871,94612,022,017,95802,265,088