euler 80

const B = 10n ** 200n, squares = [4n, 9n, 16n, 25n, 36n, 49n, 64n, 81n];
let ans = 0n;
for (let i = 2n; i < 100n; i++) {
    if (squares.includes(i)) continue;
    const X = i * B;
    let l = 0n, r = 10n ** 101n;
    while (l < r) {
        const m = l + r + 1n >> 1n;
        if (m * m <= X) l = m;
        else r = m - 1n;
    }
    l /= 10n;
    for (let j = 0; j < 100; j++) {
        ans += l % 10n;
        l /= 10n;
    }
}
console.log(ans);