Uniqueness would be a problem. The sum isn't guaranteed to have unique terms.
2 is (2,0,0) and (1,1,0).
2 is (2,0,0) and (1,1,0).
A composition is an ordered partition. A partition is the set of numbers that sum to a particular number. The 'weak' part allows zeros.
Without thinking the problem through (about to sleep) I wouldn't be surprised if the answer is easily proven to be exponential (aka a firm "nope") but math can be unintuitive at times so I thought I'd ask anyway.
I ask because, if the maximum number of potential matches isn't exponential (or is at least <= 3 digits long), it might be plausible to read through the number of matches to find "interesting" (elegant-looking) ones.