Note that the last test can't pass in time if you check for an upper bound on k only if d == {}

I see an optimization in your solution that can take it to another level when hitting composite numbers.
Not gonna spoil you more ;-)

Prime numbers is one of my favorite playground.
Now that I come back to this solution, I see that it is unnecessary complicated.
Don't hesitate if you have some questions while you dig into it.

Edit: see this fork for a cleaner and even faster code ;-)

reaaaaly fast

lol too slow

I tried others solutions from the first and down the list, and I laughed how slow they are compared to my solution going through test with big numbers. And then I tried your solution. It is really fast. I am excited to explore this code tomorrow

beautiful

I am having much pleasure with this kata, my skills grown a little and I learned something about abundant numbers and I think I see a kind of path to go further, I explored OEIS for a first time really, spent some time there, I even slightly hacked this problem. Thank you

same same same. done. did not use eyes when was reading statement

might be a copy of the same problem
https://www.codewars.com/kata/530e15517bc88ac656000716

good question, helped me a lot. good kata though - good experience

thanks!

thank you sm!

love this kata thank you very much. made my day

this is so beautiful