python solution :

def hourglass_sum(arr): max_sum = float('-inf')

# Iterate through the array, excluding the border
for i in range(len(arr) - 2):
    for j in range(len(arr[i]) - 2):
        # Compute the sum of the hourglass
        current_sum = 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]
        # Update max_sum if needed
        max_sum = max(max_sum, current_sum)

return max_sum

arr = [] for _ in range(6): arr.append(list(map(int, input().rstrip().split())))

print(hourglass_sum(arr))