94.58% faster using set and & operator in Python
\n\n\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        res = set(nums[0])\n        for i in range(1, len(nums)):\n     
![image](https://assets.leetcode.com/users/images/792f0a0d-82a2-4dd3-8bf8-54384899e999_1660553213.0318358.png)\n\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        res = set(nums[0])\n        for i in range(1, len(nums)):\n            res &= set(nums[i])\n        res = list(res)\n        res.sort()\n        return res\n        \n```
['Ordered Set', 'Python', 'Python3']