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 listMar 27, 2024 22:27emily graceemily graceScore: 121,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 22:2799,926882,565,873819,391,18702,306,048
2Mar 27, 2024 22:27121,5441,067,479,044996,661,73002,277,376
3Mar 27, 2024 22:27133,3731,158,106,4951,093,655,45302,174,976