Thanks! Updated the description.

Thanks, fixed.

It can be easily done without exceeding BigInt size. I don't think randomising the length increases the complexity in any way - it's still just one check.
I have added an explicit max length of input data(64 bits) to simplify things. Sadly, I don't see any way to easily get the max value of BigInt so this will have to do.

Thanks for the comment, I've updated the tests.
I've left full length and partial length as they were. 'partial length' means some bits may be trimmed from most significant bit's side, 'full length' means no bits trimmed.

Helper method makes debugging much nicer. Great kata!

Thanks, I've updated the description.

Forgot to mark issue as resolved.

Forgot to mark issue as resolved.

Good point, I've added explicit instruction in the description - new task should be added before the one that has just finished.
I've also added new test case for this.

Thanks for pointing this out. I've done some renaming before publishing and forgotten to update the description. Description should be ok now.
There is only one Timeslot used both by solution and test cases, it's in preloaded classes.
I've ommited namespaces as they are not neccessary and only take space in this case. Is there any advantage they provide?

Added more test cases and improved error message. Thanks for feedback.

I've fixed examples, thanks for pointing this out.

Fixed, thanks

Thanks for the feedback! :)