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 28, 2024 15:53Drew GarciaDrew GarciaScore: 100,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 15:5384,403755,072,103692,103,56802,306,048
2Mar 28, 2024 15:53100,346894,255,766822,840,58902,285,568
3Mar 28, 2024 15:53114,039996,385,919935,119,05102,301,952