Unique elements of multiple sets

Question

I have a list of sets like below. I want to write a function to return the elements that only appear once in those sets. The function I wrote kinda works. I am wondering, is there better way to handle this problem?

s1 = {1, 2, 3, 4}
s2 = {1, 3, 4}
s3 = {1, 4}
s4 = {3, 4}
s5 = {1, 4, 5}

s = [s1, s2, s3, s4, s5]

def unique(s):
    temp = []
    for i in s:
        temp.extend(list(i))

    c = Counter(temp)
    result = set()
    for k,v in c.items():
        if v == 1:
            result.add(k)

    return result

unique(s) # will return {2, 5}

Answer 1

You can use directly a Counter and then get the elements that only appear once.

from collections import Counter
import itertools
c = Counter(itertools.chain.from_iterable(s)) 
res = {k for k,v in c.items() if v==1}
# {2, 5}

Answer 2

I love the Counter-based solution by @abc. But, just in case, here is a pure set-based one:

result = set() 
for _ in s: 
    result |= s[0] - set.union(*s[1:]) 
    s = s[-1:] + s[:-1] # shift the list of sets
#{2, 5}

This solution is about 6 times faster but cannot be written as a one-liner.