What's the big-O time complexity of this code? It's extremely hard to analyze

int j=2;
int sum=0;
while(j<n){
    int k=j;
    while(k<n){
        sum+=k;
        k*=k;
    }
    j+=log(k);
}

I feel this problem is so difficult. How do I figure it out?