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 listJul 13, 2023 13:21gchebanovgchebanovScore: 7,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 13:217,478124,460,62861,315,96202,281,472
2Jul 13, 2023 13:217,558132,222,74261,975,39602,183,168
3Jul 13, 2023 13:218,071130,870,61666,179,70602,301,952