Solution.java

import java.util.Scanner;

public class Solution {


    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        int[][] arr = new int[6][6];

        for (int i = 0; i < 6; i++) {
            String[] arrRowItems = scanner.nextLine().split(" ");
            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

            for (int j = 0; j < 6; j++) {
                int arrItem = Integer.parseInt(arrRowItems[j]);
                arr[i][j] = arrItem;
            }
        }

        scanner.close();
        System.out.println(findMaxHourglassSum(arr));
    }

    private static int findMaxHourglassSum(int[][] arr) {
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                if (i > 1 && j > 1) {
                    int sum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
                            arr[i - 1][j - 1] +
                            arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
                    max = Math.max(max, sum);
                }
            }
        }
        return max;
    }
}