Binary Squash

Description

Given a list of integers, each on their own line, combine the ones adjacent ones where the binary representation does not share a one.

For example, given the list:

1
6
8
3
4

Would output:

15
7

Each number will be at most 2¹⁶