I'm not able to comeup with solution in given constraints.
![image](https://assets.leetcode.com/users/images/ed1cc3e4-034c-4440-8ae3-f0240212e20c_1654929120.2102854.jpeg)
![image](https://assets.leetcode.com/users/images/643073c7-efa1-46f4-b5cd-8c1baabdd5da_1654929125.5646486.jpeg)
More formally:
You are given l and r where r can be upto 10^12 . you need to return the count of no of pairs such that sqrt(a^2-b) is integral where b lies between l and r (both l and r are inclusive).