Xor sum

n,q = [int(x) for x in input().split()]
array = [int(x) for x in input().split()]

square_n = int(round(n**(1/2), 0))

sqrt_array_size = square_n
if square_n * square_n < n:
    sqrt_array_size += 1

sqrt_array = [0 for _ in range(sqrt_array_size)]

#preprocess
for i in range(sqrt_array_size):
    reduces_array = array[i*square_n:(i+1)*square_n]
    for elt in reduces_array:
        sqrt_array[i] = sqrt_array[i] ^ elt

def query(a, b):
    res = 0
    while (a < b) and (a % square_n != 0) and (a != 0): #before block
        res = array[a] ^ res
        a += 1

    while a + square_n - 1 <= b: #overlapped blocks
        res = sqrt_array[a//square_n] ^ res
        a += square_n

    while a <= b: #after block
        res = array[a] ^ res
        a += 1

    return res

solution = []
for _ in range(q):
    a, b = [int(x) for x in input().split()]
    solution.append(query(a-1,b-1))

for elt in solution:
    print(elt)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED