this challenge pushed me write fast algorithm, amazing

Great Kata...though my code get too large but ..

Python translation. Please, review and approve (the author is inactive).

If there isn't a middle digit and n > 9: remove the last digit

It should be stated that other steps should still apply if this condition is true.

reduce it instead of sum

It's "subtract", not "reduce".

In the initial solution the brackets and white-space are inconsistent. It would be better like this:

namespace CrazyFormula
{ 
  public class Crazy
  {
    public int CrazyFormula(long n)
    {
      //Have fun!
    }
  }
}

Added random test.

There are no random tests.

I was struggling a bit, but author of this Kata has given me excellent explanation - i suggest to check my issue if someone of you are struggling too.

@AdmiralRobinson, you've asked for help on my Kata (Give me a Crazy Formula!) and I just did that. Take a look there later! Cya :)

@AdmiralRobinson, I'll help you, below is why the result is 8:

77633658797932970, middle number is odd (7), so we reduce it (second rule): 7+7+6+3+3+6+5+8(-7)+9+7+9+3+2+9+7+0 = 84

84, there isn't a middle number in it and n > 9 so we remove the last digit (first rule) => 8

So 8 is the answer.