Ad
  • Custom User Avatar

    Ah ok, I get it now. Yes, CW runner kills tested process if it prints too much to the console. But still you can investigate how far you get by printing something smaller, like just he size of the maze, or size of your history, right? This should not exceed the buffer limit. Another gotcha is that when process is killed on timeout, output which is not flushed can be lost, so be sure that stdout is flushed after each print.
    If you are still stuck, you can post your code for others to check (remember about markdown formatting and spoiler flag, or, even better, ask for some advice on kata solving gitter chanel.

  • Custom User Avatar

    I get buffer overload error or something, so it seems like my algorithm is fairly good...

    Your implementation crashes, but otherwise it has to be really good indeed :D

    Jokes aside, you need to store some kind of history to solve the problem, so that's ok. However, tests seem to be kinda challenging, because my solution takes ~7.5s out of 12s allowed so you do not have too much time to waste.