Set Operations Challenge

Hard Sets PRO

🔒 Login to Unlock

Problem Statement

Write a Python program that takes two sets of numbers and returns the sum of elements present in their union minus the intersection.

Input Format

Line 1: First set integers. Line 2: Second set integers.

Output Format

Print the resulting integer sum.

Constraints

Integer sets

Sample Input

1 2 3
2 3 4

Sample Output

Explanation

Union minus intersection is equivalent to the symmetric difference sum.

Starter Code

def set_challenge(s1, s2):
    # Write your code here
    pass

s1 = set(map(int, input().split()))
s2 = set(map(int, input().split()))
print(set_challenge(s1, s2))

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock