Maximum Contiguous Subarray Sum

Given a string of comma-separated integers, your task is to find the maximum sum of any contiguous subarray. This is a classic problem which can be efficiently solved by Kadane's Algorithm.

Consider an array \(a_1, a_2, \ldots, a_n\). The goal is to find a subarray \(a_i, a_{i+1}, \ldots, a_j\) such that its sum is maximized. Kadane's algorithm does this in \(O(n)\) time.

The input is provided as a single line through standard input, and the output should be printed to standard output.

inputFormat

The input consists of a single line containing a comma-separated list of integers. For example: 1,2,-3,4,5

outputFormat

Output a single integer which is the maximum sum of any contiguous subarray.

## sample

5

5

</p>