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 23, 2024 13:04DanielDanielScore: 1,369,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2024 13:041,355,81317,600,392,82611,117,665,64502,285,568
2Jul 23, 2024 13:041,369,94817,753,003,49911,233,576,05602,236,416
3Jul 23, 2024 13:041,384,12517,846,701,39411,349,821,31702,330,624