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 17:34Drew GarciaDrew GarciaScore: 126,456Success
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 17:3473,553670,899,863603,132,43502,281,472
2Mar 29, 2024 17:34126,4561,104,655,2851,036,935,85602,224,128
3Mar 29, 2024 17:34131,4751,145,451,2171,078,092,17102,285,568