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 29, 2024 20:54Drew GarciaDrew GarciaScore: 71,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 20:5459,307551,582,488486,316,35702,285,568
2Mar 29, 2024 20:5471,522648,410,726586,484,30502,256,896
3Mar 29, 2024 20:5471,552655,429,554586,725,94602,281,472