A suggestion maybe, but not an issue.

I had exactly the same thing. And then, I solved the kata ^^

Please do not rely on solver to define types for you. If you really, really want some custom type ( and in this case it adds nothing but fragility ), define it in Preloaded and import it in solution and tests.

already done

'alr approved some time ago'

The time complexity check is exactly the way it should be - small number of tests with enormous input size. A correct solution (+ reference, + actual testing) will take mere 3 seconds.

Duplicate, see above.

The kata description has stated that "palindromic number made from the product of any amount of AT LEAST 2 numeric arguments". No issue now.

You did that for JavaScript, I did it just now for Haskell; other translations may not have been updated.

ETA: I read all those sources in languages I don't know, and it looks like all of them use (2,10000).

corrected in python

. (needed to update my previous message)

.

done.

Fixed