HomeBinary Squash
A challenge by
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<sup>16</sup>
Leaderboard
| Author | Score | ||
|---|---|---|---|
| #1 |
|
bizy-coder | 57 |
| #2 |
|
hallvabo | 59 |
| #2 |
|
EroticShiveringKingBanana | 59 |
| #4 |
|
Bulmenisaurus | 60 |
| #5 |
|
AlephSquirrel | 61 |
JavaScript (Deno)
JavaScript (NodeJS)
Python
Rust
C (tcc)
APL (TinyAPL)
Vyxal
Vyxal 3