You can cache the result if you want but that is not useful here.

I don't think so.

The number of parts in a partition grows very fast. For n = 50 number of parts is 204226, for 80 it is 15,796,476 It would be too long to tests answers with arrays of such size. So our task is the following:

1 - n being given (n integer, 1 <= n <= 50) calculate enum(n) ie the partition of n. We will obtain something like that:
enum(n) -> [[n],[n-1,1],[n-2,2],...,[1,1,...,1]] (order of array and sub-arrays doesn't matter). This part is not tested.

The kata asks to calculate enum(n) in 12 seconds, and this solution fails to do what is asked.

~ is bitwise complement - it inverses each bit of a number.
Consequently, ~b == -b - 1

what does the ~ do in list indices? I really don't get that bit

Damn, I solved it in a wrong way then...

not tested for regex

¯\(ツ)/¯

it did lol.

Such a good short, clean and easy to understand answer. Well done!