Python || 95.20% Faster || Bit Manipulation || O(1) Solution
\nclass Solution:\n    def getSum(self, a: int, b: int) -> int:\n        f=0\n        if a<0 and b<0:\n            f=1\n        mask=0xffffffff\n        add=a^b
```\nclass Solution:\n    def getSum(self, a: int, b: int) -> int:\n        f=0\n        if a<0 and b<0:\n            f=1\n        mask=0xffffffff\n        add=a^b\n        carry=(a&b)<<1\n        while carry!=0:\n            add,carry=(add^carry)&mask,((add&carry)<<1)&mask\n        if f:\n            return ~(add^mask)\n        return add       \n```\n\n**An upvote will be encouraging**
['Bit Manipulation', 'Python', 'Python3']