Yes, it is more clear for me now.

oh I see, is it ok now?

I read it as "no (repeating or zero integer roots)". Also "zero integer roots" reads like "it should have at least one integer root".

I don't get it, the current description already states "integer roots"

Description was not clear for me. I would suggest to change it to

Let's call this polynomial compact if it has only integer roots which are non-repeating and non-zero and ...

Currently it sounds like real and complex roots are ok.

Try not to use floating point arithmetic.

Guys,
I thought I understood the problem well and found the proper solution to it.
(JS)
At that, while my solution always passes complete set of "small" random tests, it fails the 1st "big" test.
Can there be something wrong with JS "big" tests or I am really so stupid on Friday morning :) ...

done

upper bound lowered

I published a fork, but please review it, there are a few changes I'm not too sure about. And yes, I couldn't make a fork because I was on my phone.

I made a fork for the Python test cases.

• Added more fixed tests, with hardcoded solutions
• Separated the tests into Small, Medium and Big for both fixed and random tests.
• Reduced the amount of random tests from 1000 to 150, 1000 felt like it was too much.
• Provided the input upon failing a test.
• Removed the test indexation, for example, failed on test 324. I didn't see a good reason for it, especially with fewer tests.

Any of these changes can be reverted, so be sure to let me know if you disagree with any of them.

JavaScript: either BigInt should be used or the input upper bound should be lowered in random tests.

Feel free to suggest changes or a fork. Just make sure to keep test output a black box.

I'd say that the testing and error messages could use some work. However, there's only so much feedback that can be provided without spoiling the kata.