🐍 If you want to solve in your favorite IDE - you can copy """Sample Input""" there and make 2D array from it

sample_input = """0 -4 -6 0 -7 -6 -1 -2 -6 -8 -3 -1 -8 -4 -2 -8 -8 -6 -3 -1 -2 -5 -7 -4 -3 -5 -3 -6 -6 -6 -3 -6 0 -8 -6 -7"""

arr = [list(map(int, line.split())) for line in inpuT.split("\n")]

FOR JAVA

public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

    List<List<Integer>> arr = new ArrayList<>();

    IntStream.range(0, 6).forEach(i -> {
        try {
            arr.add(
                Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
                    .map(Integer::parseInt)
                    .collect(toList())
            );
        } catch (IOException ex) {
            throw new RuntimeException(ex);
        }
    });

    int answer = Integer.MIN_VALUE;
     for (int i = 0; i <= 3; i++) { 
        for (int j = 0; j <= 3; j++) { 
            int sum = 0;

                sum += arr.get(i).get(j);     
                sum += arr.get(i).get(j + 1); 
                sum += arr.get(i).get(j + 2); 

                sum += arr.get(i + 1).get(j + 1);

                sum += arr.get(i + 2).get(j);     
                sum += arr.get(i + 2).get(j + 1); 
                sum += arr.get(i + 2).get(j + 2); 

                answer = Math.max(sum, answer);
        }
    }
    System.out.println(answer);

    bufferedReader.close();
}

}

JavaScript Solution

const maxLength = arr.length;
let max = -Infinity;
let arrAux = Array(3);
let sum = 0;

const getHourglassSum = (arr) => {
  let sum = 0;
  for (let i = 0; i < 3; i++) {
    for (let j = 0; j < 3; j++) {
      sum += arr[i][j];
    }
  }
  sum = sum - arr[1][0] - arr[1][2];
  return sum;
};

for (let i = 0; i < maxLength - 2; i++) {
  for (let j = 0; j < maxLength - 2; j++) {
    arrAux[0] = arr[i].slice(j, j + 3);
    arrAux[1] = arr[i + 1].slice(j, j + 3);
    arrAux[2] = arr[i + 2].slice(j, j + 3);
    sum = getHourglassSum(arrAux);
    if (sum > max) max = sum;
  }
}

console.log(max);

best solution arr.append(list(map(int, input().rstrip().split()))) maxSum = - 63 for i in range(4): for j in range(4): hourglassSum = (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]) maxSum = max(maxSum, hourglassSum) print(maxSum)

in c#

List> arr = new List>();

    for (int i = 0; i < 6; i++)
    {
        arr.Add(Console.ReadLine().TrimEnd()
                    .Split(' ')
                     .ToList()
                     .Select(arrTemp => Convert.ToInt32(arrTemp))
                     .ToList());
    }

   List<List<int>> result = new List<List<int>>();
   int indexNumber=0;
   int lenght_arr=arr[0].Count();

   for(int i=0; i<=3;i++)
   {
       for(int j=0; j<= lenght_arr-3;j++)
       {
          if(result.Count <= indexNumber) 
          {
              result.Insert(indexNumber,new List<int>());
          }

           result[indexNumber].AddRange(arr[i].Skip(j).Take(3).ToList());
           result[indexNumber].AddRange(arr[i+1].Skip(j+1).Take(1).ToList());
           result[indexNumber].AddRange(arr[i+2].Skip(j).Take(3).ToList());

           indexNumber++;
       }

   }

   int maxnumber=result.Select(x=>x.Sum()).Max();

       Console.WriteLine(maxnumber);