**Name:**Jomo Pipi

**Clan:**NuniSynth

**Skills:**screaming into the void: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

This comment is hidden because it contains spoiler information about the solution

hmm

Fixed by moving another sanity test to even before this one. Added a fixed test for it. Had to fix the reference solution as well.

This fix may have invalidated existing solutions. :/

That should have been fixed four years ago.

Was that fix reverted or something?

ETA: seems it was never fixed. The problem is an artifact of an early sanity check; if the sum of the digits in the input is divisible by three you can never make a prime number. Unless the input is

`[3]`

.I just wanted to take it easy :D

Should raise it as an issue?

looks rather like an issue, no?

Found an incorrect test:

Short

I recommend adding a fixed test for

`stringFunc(stringOfLength(999998), 99999)`

where

`stringOfLength(n)`

is a string of length`n`

containing at least two distinct characters, e.g. (in Java):or just some random string.

You might as well take 1000001 for

`n`

.You're right, thank you. Then just take my generator (it produces a string consisting of 65536 different characters, of course).

As it turned out, the number of different characters doesn't matter much. Even a string of 2 repeating characters works well:

Nitpick: in Java, there cannot be 999980 different values of

`char`

;)I recommend adding a test for

`jumbledString(stringOfLength(999980), 50000)`

where

`stringOfLength(n)`

is any string of`n`

different characters, e.g. (in Java):You might also take 999499 for

`n`

.beautiful

Fixed

fixed, thanks

## Loading more items...