Performance deep dive

In this approach, we'll find out how to most efficiently calculate the value for Grains in C#.

The approaches page lists two idiomatic approaches to this exercise:

1. Using Pow
2. Using bit shifting

Benchmarks

To benchmark the approaches, we wrote a small benchmark application using BenchmarkDotNet library.

Enumerating a Range from 1 to 64 to sum each call of Square (which uses Pow) is about thirty-five times slower than using bit shifting on BigInteger.