This comment is hidden because it contains spoiler information about the solution
If you can figure out what this guy wants from this kata without having to read it 20 times then you should automatically get promoted to 2kyu.
This kata isn't worth 5 kyu. At most 6 kyu.
I thing in Codewars there should be two different scales of difficulty. One Codewar's and second the CodeWarsMyjinxin2015 scale. :)
THX JohanWiltink, great kata, a lot of fun, my first 1kyu :)
More people have asked "how fast does my solution need to be?"
There is no one answer, of course.
Read the comments here and you may get a feel. I think the tests are more or less the same for all languages, though some do and some do not have the medved test.
THX, medved clues solved, but I'm still wondering what is proper time of simple tests to attempt solution.
Scroll down and see comment by @medved01
Maybe my question was confusing. I'm wondering about sample test time, before the attempt. My actual times are 669 ms. And that is not enough :).
Last question, medved test? What is that?
12 seconds, according to documentation. You're lucky; C# doesn't seem to have the medved test yet.
What test time should I reach to pass this kata ?
thx, very nice kata, too hard for me :)
hi @bq666. There are 50 of these heavy tests
What time should I receive when finding the nearest number to 5,1(9) - e14. Other words, how many tests on "big" numbers do you have in tests?
Right now I have 1782.15ms when running only this test test.assert_equals(find_closest_value(519999999999999), 520000000000000)