97.81% faster using set and set.intersection
\n\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        inter = set(nums[0])\n        for i in range(1, len(nums)):\n     
![image](https://assets.leetcode.com/users/images/a155a472-e97a-456a-b8b3-7db652ebf923_1661637583.5699358.png)\n```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        inter = set(nums[0])\n        for i in range(1, len(nums)):\n            inter = inter.intersection(set(nums[i]))\n        inter = sorted(list(inter))\n        return inter\n```
['Python3']