Ad
  • Default User Avatar

    I don't think so. I spent a couple of hours implementing it by reading the wiki, a blog post and using the site sha256algorithm.com to understand the steps and how it works. I did it in Erlang and learned a bit of the language operators for binary data in the process, which I don't use often. It was fun.

  • Default User Avatar

    Your algorithm is likely not scaling well in terms of performance for bigger n.
    My first algorithm would get the 12 sec limit when attempting this kata.
    Turns out I had to take a completely different approach for it to scale better. My submitted solution on my i9 takes almost 5 seconds to compute "theBee 1000".
    I benchmarked other solutions on the site, and they took between half the time, to double the time of mine.