Yes, fixed already, thanks everyone.

Ok, never mind, all good.

See https://discord.com/channels/846624424199061524/850435343789850636/956948053074514022

Ok, thanks for the discussion.

I will delete this kata now.

Edit: Hmm, can not delete it, clicked on un-publish for now.

I agree on your last point.

I looked at the sample tests again, I do not see an invalid solution, e.g. n=1e5 pages should give a total of 488895 digits, no?

When I hit the publish button, I get a message 'Kumite was published with failed tests!' below highlighted in orange background. (But the tests all pass.)

Do I maybe need approval from you?

Thanks, I will fix this asap.

I did see a lot of very inefficient solutions in Java, they pass the tests in the orignal kata because n is not very big.

Now that I am thinking about it, it is probably not worth having a separate kata, simply pointing out the inefficient solutions in the orignal kata may be enough.

Concerning you second point: I am not testing summary=10 (or any other summary that is not valid, because I generate it with an algorithm out of a random n.

Done! Thanks for notifying.

Edit: Hmm, not yet, some issues, looking into this right now.

Concerning the second issue: Can you give me an example?

Hi B1ts,

if you find an efficient algorithm, then it will of course work for the other kata as well.

The description says: 'Be aware that you'll get enormous books having up to 100.000 pages.'

Your solution looks extremely ineffcient to me. Maybe add some print commands and check the sample tests.

Yes. It would definitely limit the amount of viable solutions.

Btw: The random tests could in principle go up to 100,000,000 pages. But I choose 100,000 to match the python kata.

Hello alexbur,

yes, I am pretty sure. I generate a random number of pages n and use the formula in https://oeis.org/A058183 to compute summary.

Java translation