The best solution so far! So clever and simple!

Max (or near max) indexes should be tested for all bases, otherwise invalid solutions can pass, that don't check high enough primes (e.g. base 30, k = 150)

did exactly the same, some 30 years ago, on the C64 ;-)

The idea of codewar is to not import

Where exactly did you get this from?

I didn't think about RegEx 😅
I like this solution.

got it

Thanks for the fun kata. Brings back memories of looking at hex dumps of RPG programs and wondering what in the world they meant.

oh i did the same)

That's literally how actual programming looks. As lazy as possible :D

Approved

good!

25 is feasible, maybe optimum

approved as the average voted rank.

Also updated the description, adding:

... pad it so that the ASCII block is aligned, as in the below example

As written in the description:

If the last line is shorter than 16 bytes, then replace the byte values with spaces, but trim the trailing spaces from the end of the line.

The ascii block (on the right) should be aligned, like this:

00000040: 08 4a 12 25 79 c2 dd 31 6b b8 77 74 4b 68 4b d4  .J.%y..1k.wtKhK.
00000050: db 4e 92 09 d5 4c 9f 0b fd a9 d1                 .N...L.....

and not messed up, like this:

00000040: 08 4a 12 25 79 c2 dd 31 6b b8 77 74 4b 68 4b d4  .J.%y..1k.wtKhK.
00000050: db 4e 92 09 d5 4c 9f 0b fd a9 d1  .N...L.....

Oh, and note that 240+ people solved it in python without such a problem, so it's not an issue of the kata.

Cheers