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 14:49gchebanovgchebanovScore: 7,599Success
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 14:497,468114,310,56361,235,87602,252,800
2Jul 13, 2023 14:497,599124,777,91462,311,40402,293,760
3Jul 13, 2023 14:497,688135,598,52263,038,99202,269,184