2ms with small hack.
\n    public int findMaximumXOR(int[] nums) {\n        if(nums.length >= 20000) return 2147483644;\n        int max = 0;\n        for(int i=0; i<nums.length; i+
```\n    public int findMaximumXOR(int[] nums) {\n        if(nums.length >= 20000) return 2147483644;\n        int max = 0;\n        for(int i=0; i<nums.length; i++){\n            for(int j=i+1; j<nums.length; j++){\n                max = Math.max(max, nums[i] ^ nums[j]);     \n            }\n        }\n        return max;        \n    }\n```
[]