XOR of Binary Strings
You are given two binary strings
a and b. Both strings may be quite long, containing up to 1000 bits. Your task is to compute the bitwise XOR of these two binary strings and output the result.Input
The first line contains the first binary string
a (1 ≤ |a| ≤ 1000).The second line contains the second binary string
b (1 ≤ |b| ≤ 1000).Both strings have the same length.
Output
Output a single binary string: the bitwise XOR of
a and b having the same length as the input strings.Examples
Input | Output |
1101
1010 | 0111 |
111
000 | 111 |
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB