Lang-Florian

fn find_single_missing(set: &[u64], total: &[u64]) -> u64 {
    let mut acc: u64 = 0;
    for &num in set {
        acc ^= num;
    }
    for &num in total {
        acc ^= num;
    }
    acc
}