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 16:43Drew GarciaDrew GarciaScore: 105,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 28, 2024 16:4396,776844,335,052793,562,02302,285,568
2Mar 28, 2024 16:43105,522927,314,008865,280,92002,285,568
3Mar 28, 2024 16:43107,800961,317,076883,962,14202,281,472