Fall Down

using System;
class FallDown
{
  static void Main()
  {
    //Telerik Academy
    //You are given a list of 8 bytes (positive integers in the range [0…255]) n0, n1, …, n7. These numbers represent a square grid consisting of 8 lines and 8 columns. Each cell of the grid could either be empty or full. The first line is represented by the bits of n0, the second – by the bits of n1 and so on, and the last line is represented by the bits of n7. Each bit with value 1 denotes a full cell and each bit with value 0 denotes an empty cell. The lines are numbered from the first (top) to the last (bottom) with the numbers 0, 1, …, 7. The columns are numbered from right to left with the indices 0, 1, …, 7. The figure shows a sample square grid and its representation by a sequence of 8 numbers n0, n1, …, n7:
    //  7   6   5   4   3   2   1   0
//0                                 n0 = 0
//1     ■                         n1 = 64
//2                 ■             n2 = 8
//3                 ■             n3 = 8
//4                                 n4 = 0
//5                 ■ ■         n5 = 12
//6 ■ ■ ■                     n6 = 224
//7                                 n7 = 0

//  7   6   5   4   3   2   1   0
//0                                 n0 = 0
//1                                 n1 = 0
//2                                 n2 = 0
//3                                 n3 = 0
//4                                 n4 = 0
//5                 ■             n5 = 8
//6     ■         ■             n6 = 72
//7 ■ ■ ■     ■ ■         n7 = 236

    //Suppose the full cells hold squares which can "fall down" by the influence of the gravity. Each full cell in certain row and column falls down to the lowest row possible but stays in the same column and up from any other full cells on the same column that ware initially down from it. At the figure the "fall down" process is illustrated.
    //Write a program to calculate how the grid will look like after the "fall down" process is applied.

    int inputNum = 0,
        bitsSum = 0,
        bufferNum = 0;
    int[] numsArray = new int[8];
    int[] fallDownNumsArray = new int[8];

    //Read the number from the console and input them in an array
    for (int inputIndex = 0; inputIndex <= 7; inputIndex++)
    {
      inputNum = int.Parse(Console.ReadLine());
      numsArray[inputIndex] = inputNum;
    }

    //Check how many 1 there are in each column and create the column numbers.
    for (int bitIndex = 0; bitIndex <= 7; bitIndex++)
    {
      for (int arrayElemIndex = 0; arrayElemIndex <= 7; arrayElemIndex++)
      {
        bitsSum += ((numsArray[arrayElemIndex] & (1 << bitIndex)) >> bitIndex);
      }
      for (int fallNumIndex = 0; fallNumIndex < bitsSum; fallNumIndex++)
      {
        bufferNum = (bufferNum | (1 << fallNumIndex));
      }
      fallDownNumsArray[bitIndex] = bufferNum;
      bufferNum = 0;
      bitsSum = 0;
    }

    for (int bitIndex = 0; bitIndex <= 7; bitIndex++)
    {
      bufferNum = 0;
      for (int arrayIndex = 0; arrayIndex <= 7; arrayIndex++)
      {
        int bitAtPos = ((fallDownNumsArray[arrayIndex] & (1 << bitIndex)) >> bitIndex);
        if (bitAtPos == 1)
        {
          bufferNum = (bufferNum | (1 << arrayIndex));
        }
      }
      numsArray[bitIndex] = bufferNum;
    }

    for (int i = 7; i >= 0; i--)
    {
      Console.WriteLine(numsArray[i]);
    }
  }
}