1993. Sum of All Subset XOR Totals
My accepted Python solution to LeetCode problem 1993, Sum of All Subset XOR Totals, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.2MB, accepted 2025-12-31.
class Solution:
def subsetXORSum(self, nums: List[int]) -> int:
result = 0
for num in nums:
result |= num
return result * (2 ** (len(nums) - 1))