so basically you want to look at your prime algorithms efficiency? perhaps its not efficient when searching if a number is prime or not.

optimized my code and everything passes. kata's should mention time complexity in the description.

This kata's description should mention algorithm efficiency, e.g. Time complexity Big O for example....

Sample Tests pass but the Attempt fails with a 12000ms time out mentioning algorithm efficiency problems. My prime algorithm uses the trial division primality test. Are we expected to use a more sophisticated algorithm like the Miller-Rabin primality tests for this kata?  

nevermind found my issue.

greetings,

this part where it says, (the following chars: ".,:;-?! '()$%&" and the '"'-char)....does the last part mean, " symbol as in double qoutation mark for the last char in the region of chars?

yes, saw the "Do this n times!" I think its still vague, e.g. what does doing it n times give? e.g. if I run it 100 times vs 10?

The description does not explain the kata well. parameter n is not even described or mentioned aside for the function parameter decleration...when writing kata's software develpment practices should be a given.

if i try a higher ranked kyu challenge and the test output show that the "actual" matches the "expected" results exactly but the tests still fail, who do I ask for help as I cannot post on a higher kyu challenge?

Ok, I fixed my code to reflect the correct logic and it works now. Random test case passed. thx