my algo was store double for table[4]=log10{ 2^96,2^64,2^32,0}
in table.

arr[i][4],arr[j][4]

i from 1 to n
j from i+1 to n
    k from 0 to 4
    {
        a=arr[i][k],barr[j][k]
        if(!a)
           sum+= floor( log10(a) + table[k]),break;
    }

This gets TLE on case 8 can someone tell me better algorithm or test cases.