Minimum Sum of Four Digit Number After Splitting Digits

Given a positive four-digit integer, split its digits into two numbers (using all digits, leading zeros allowed) and return the minimum possible sum of those two numbers. The core challenge is finding the optimal arrangement/distribution of the four digits (a small combinatorial/greedy problem, typically solved by sorting) to minimize the sum.