Please forgive the lack of formal vocabulary.
Which set has a larger cardinality?
A) a set of all possible countably infinite strings with a finite alphabet of symbols.
B) a set of all possible finite strings with a countably infinite alphabet of symbols.
(And in case this is needed, the order of symbols matters, and repetition is allowed (otherwise A will have problems) )
*And another question in reply to a comment by Element118. Is B the same size as the the set of positive integers? I would guess that B is larger than the set of integers because the subset of B containing all strings with only one symbol would completely match-up with the integers, leaving all the other subsets of finite strings free from a one-to-one correspondence.