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 listMay 9, 2023 21:35Franek KortaFranek KortaScore: 16,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2023 21:3516,116189,607,956132,154,56502,183,168
2May 9, 2023 21:3516,858187,795,286138,239,67102,273,280
3May 9, 2023 21:3517,260194,942,652141,529,31402,228,224