You are given a Python function that processes a list of user transactions. The function currently uses nested loops resulting in O(n^2) time complexity. Analyze the code, identify the bottleneck, and rewrite it to achieve O(n) or O(n log n) time complexity. Additionally, explain the space-time trade-offs of your solution and provide unit tests to verify correctness.