Well, I thought they were going to update it quickly. They sent me the revised version over a week ago, and we only made a few minor changes. I'm not sure what happened. Now that I am responding, they will probably update it today.
Basically, the input is going to be an integer string of up to 10,000 digits and a U8 value for N. The output will also be an integer in string form. The rest of the task remains essentially the same - find the Nth root of the input value. Now the challenge is to figure out an optimal way to represent the large numbers and to do the necessary math to calculate the root. It should require the use of all four basic math operations in large integer format, unless somebody knows a better way to do it than I have figured out so far.
I've been working on a solution for the last week or so, and now have a working version. I am at about 1.6 seconds for the square root of 10000 digits, but the time decreases rapidly with higher values of N. Interestingly, the size of N doesn't matter nearly as much as the size of the root.
Bruce
Bruce Ammons
Ammons Engineering