Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.
A subarray is defined as a contiguous sequence of numbers in an array.
A subarray [numsl, numsl+1, ..., numsr-1, numsr] is ascending if for all i where l <= i < r, numsi  < numsi+1. Note that a subarray of size 1 is ascending.
 
Please complete the following python code precisely:
```python
class Solution:
    def maxAscendingSum(self, nums: List[int]) -> int:
```