HackerRank Hour Glass sum in 2D Array -DS using C

Solution:

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    int arr[6][6],i,j;
    long temp=0,max=-340000;
    for(int arr_i = 0; arr_i < 6; arr_i++){
       for(int arr_j = 0; arr_j < 6; arr_j++){
         
          scanf("%d",&arr[arr_i][arr_j]);
       }
    }
     for(i=0;i<=3;i++)
    {
        for(j=0;j<=3;j++)
        {
            temp=(arr[i][j] + arr[i][j+1]+arr[i][j+2] + arr[i+1][j+1] + arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]);
        
            if(max<=temp)
                max=temp;
        }
    }
    printf("%ld",max);
    return 0;
}