Leetcode 1800. Maximum Ascending Subarray Sum

Given an array of positive integers, return the maximum sum of any contiguous strictly increasing subarray. The core challenge is to identify increasing runs and track their cumulative sums to find the largest.