Questions tagged [bitwise]

For challenges involving bitwise commands or manipulation of numbers at the bit level

Filter by
Sorted by
Tagged with
18 votes
12 answers
2k views

Is it a valid ARM immediate value?

Exposition In this challenge, I am talking about ARM assembly language. ARM is a 32-bit RISC processor; I'll use instruction set up to architecture v6. To load a constant ("immediate") value ...
anatolyg's user avatar
  • 13.5k
17 votes
18 answers
2k views

XOR of independent Bernoulli variables

In probability theory, a Bernoulli variable is a random variable which has a single parameter \$p\$, and is equal to 1 with probability \$p\$, and 0 with probability \$1-p\$. In this challenge, there ...
Command Master's user avatar
1 vote
0 answers
158 views

making a binary string palindrome using xor operations [closed]

Problem You are given a binary string A of length N. You can perform the following type of operation on the string A: Choose two different indices \$i\$ and \$j\$ (\$1 \le i\$, \$j \le N\$) Change \$...
hemanth's user avatar
  • 11
15 votes
3 answers
563 views

Count the number of disjoint 11 blocks

The task is to count the number of disjoint 11 blocks in a 64-bit word, using the minimum number of straight-line instructions. That is, how many nonoverlapping ...
Falk Hüffner's user avatar
2 votes
3 answers
308 views

Shift distance of number [closed]

Given two non-zero 16-bit integers a and b, decide the smallest number of shift operations needed to turn ...
l4m2's user avatar
  • 23.8k
8 votes
3 answers
373 views

Smallest and largest 100-bit square with maximum Hamming weight

Introduction In the binary representation of a \$k-\$bit \$(k>1)\$ square number \$n^2, \$ not all bits can be \$1\$. The maximum number of \$1\$-bits (Hamming weight, \$B\$ for short) is given in ...
Hugo Pfoertner's user avatar
8 votes
2 answers
606 views

Inverting string-based binary number in one line in Python

I want to read two strings on separate lines, each string the same length and containing only 0's and 1's, and determine if the first is the one's complement of the second. How succinctly can this be ...
Fixee's user avatar
  • 181
4 votes
19 answers
573 views

Double bit rotation to the right [closed]

Given a positive integer as input, output that integer, but with its bits rotated two times to the right. Also, think of the number as a donut of bits, eg. ...
Joao-3's user avatar
  • 1,103
0 votes
4 answers
129 views

Calculate the truncated log2 of some unsigned integer [duplicate]

Definition Given some number, x calculate the smallest number i such that 2i≥x. This is not a duplicate of this question. It is slightly different in that an input of 16 should yield an output of 4 ...
Nigel's user avatar
  • 347
6 votes
3 answers
387 views

Dr. Lamport's Unfinished Business

Introduction Dr. Leslie Lamport, of the eponymous Lamport one-time signature scheme, is getting rather old. But he can't die until his most famous algorithm gets all the kinks ironed out! In ...
JamesTheAwesomeDude's user avatar
16 votes
6 answers
876 views

Golf this Thumb-2 Constant!

One thing that is constantly frustrating when golfing ARM Thumb-2 code is generating constants. Since Thumb only has 16-bit and 32-bit instructions, it is impossible to encode every immediate 32-bit ...
EasyasPi's user avatar
  • 4,790
18 votes
9 answers
1k views

The Koszul Sign Rule

A Bit of Background The exterior algebra is a central object in topology and physics (for the physics concept cf. fermion). The basic rule dictating the behavior of the exterior algebra is that \$yx =...
Hood's user avatar
  • 2,115
12 votes
9 answers
1k views

Simulate D Flip-Flop

Objective Simulate an edge-triggered D Flip-Flop. What is D Flip-Flop? A D flip-flop is an electronic digital device that outputs an inputted data (abbr. D) with synchronization to a clock (abbr. ...
Dannyu NDos's user avatar
  • 5,941
16 votes
23 answers
2k views

Summing a sub-square of a quarter of an infinite chessboard

Description of the problem Imagine a quarter of an infinite chessboard, as in a square grid, extending up and right, so that you can see the lower left corner. Place a 0 in there. Now for every other ...
RGS's user avatar
  • 14.1k
7 votes
13 answers
214 views

Computational Parity Party! [duplicate]

The computational parity of an integer is defined as 1 if the integer has an odd number of set bits, and 0 otherwise. (src). Input You will receive one nonnegative integer that you will take the ...
S.S. Anne's user avatar
  • 3,308
28 votes
12 answers
4k views

Compress 8 bits to 6 when certain bit patterns will never occur

Consider an eight bit number in which an even position bit will never be 1 if one of its neighbors is 0 (considering MSB and LSB as neighbors). There are fewer than 64 such numbers, so there is at ...
Sparr's user avatar
  • 6,058
-2 votes
7 answers
426 views

Interpreting the Wolfram Code

Introduction An elementary cellular automaton is a cellular automaton that is 1-dimensional and has 2 states, 1 and 0. These cellular automata are categorized based on a simple code: the Wolfram code,...
sugarfi's user avatar
  • 2,193
-2 votes
2 answers
287 views

Mirror, Mirror, on the wall. Who's the fairest of them all?

Well, you know it's Snow White, and the evil Queen is at it again. Will Snow White be saved? Will she fall asleep once again? Will the Prince find her? Challenge: Given an arbitrary number (>= 2) ...
Avi's user avatar
  • 279
22 votes
22 answers
8k views

Floating Point XOR

Your task is pretty simple. Given two floats, bitwise xor the binary representation of them, and output that as a float. For example, ...
virchau13's user avatar
  • 499
19 votes
22 answers
5k views

Decode a variable-length quantity

A variable-length quantity (also referred to as VLQ or uintvar) is a way to encode up to a 28 bit integer value using only as many bytes as necessary. This was used ...
640KB's user avatar
  • 11.8k
12 votes
30 answers
1k views

String to Bit Transition

Task Given an input string of one or more ASCII characters which codepoints are between 0 and 128 (exclusive), do the following: Convert each character into its 7-bit ASCII code (if the ASCII code is ...
justhalf's user avatar
  • 2,249
31 votes
2 answers
1k views

Can a neural network recognize primes?

Background Recognizing primality seems like a poor fit for (artificial) neural networks. However, the universal approximation theorem states that neural networks can approximate any continuous ...
A. Rex's user avatar
  • 2,579
10 votes
21 answers
2k views

Compare four integers, return word based on maximum

This function should take four integer inputs (a,b,c,d) ...
Mr Anderson's user avatar
1 vote
1 answer
259 views

(bit)Wise Images [closed]

Given a truth table and two images, use the truth table as a bitwise operation to the two images. For example with the truth table: 1 0 1 0 0 0 1 0 (Note that ...
MilkyWay90's user avatar
  • 2,722
19 votes
32 answers
8k views

Find the number of leading zeroes in a 64-bit integer

Problem: Find the number of leading zeroes in a 64-bit signed integer Rules: The input cannot be treated as string; it can be anything where math and bitwise operations drive the algorithm The ...
Dave's user avatar
  • 335
26 votes
17 answers
3k views

Toggle some bits and get a square

Given an integer \$N>3\$, you have to find the minimum number of bits that need to be inverted in \$N\$ to turn it into a square number. You are only allowed to invert bits below the most ...
Arnauld's user avatar
  • 192k
20 votes
22 answers
4k views

Double, XOR and do it again

We define the function g as g(n) = n XOR (n * 2) for any integer n > 0. Given x > 0, find the smallest integer y > 0 such that gk(y) = x for some k > 0. Example ...
Arnauld's user avatar
  • 192k
3 votes
2 answers
350 views

Wanna be an Alchemist

Wanna be an Alchemist I've been watching Full Metal Alchemist these past days and I've been wondering, It is really possible to trans-mutate matter? In the real world, I don't know if it is possible, ...
Luis felipe De jesus Munoz's user avatar
17 votes
17 answers
4k views

XOR sort an array

Given a key, and an array of strings, shuffle the array so that it is sorted when each element is XOR'd with the key. XOR'ing two strings To XOR a string by a key, XOR each of the character values ...
ATaco's user avatar
  • 10.8k
13 votes
23 answers
2k views

Alternating bit smearing

Introduction This challenge requires you to set the trailing zeros of an integers binary representation to 010101…, this is best explained with an example: Given ...
ბიმო's user avatar
  • 16.8k
23 votes
2 answers
903 views

Bitwise XOR of rational numbers

Introduction Every rational number between 0 and 1 can be represented as an eventually periodic sequence of bits. For example, the binary representation of 11/40 is ...
Zgarb's user avatar
  • 42.6k
34 votes
36 answers
6k views

Calculate the longest series of 1's in an integer's binary value

Goal Given a non-negative integer, create a function that returns the starting position of number of largest consecutive 1's in that integer's binary value. When given an input ...
Defacto's user avatar
  • 575
4 votes
1 answer
279 views

Find the Closest Double Palindrome

Given a double-precision float, find the closest double-precision float whose binary representation is a palindrome. Input A floating point number x. You may use ...
AJMansfield's user avatar
  • 2,888
14 votes
8 answers
2k views

Exploring the xorspace

The xorspace of a set of integers is the set of all integers that can be obtained by combining the starting integers with the usual bitwise xor operator (^). For ...
Grimmy's user avatar
  • 15.7k
10 votes
32 answers
2k views

Do two numbers contain unique powers of 2

Break two numbers up into their powers of 2, if they share any, return a falsey value. Otherwise, return a truthy value. If one input is 0, the answer will always ...
ATaco's user avatar
  • 10.8k
22 votes
19 answers
2k views

Different number, same weight

Background The Hamming weight of an integer is the number of ones in its binary representation. For this challenge, integers are represented with 32 bits, and they are unsigned. Challenge Given an ...
musicman523's user avatar
  • 4,772
18 votes
9 answers
624 views

Make Wise Numbers

Wise is a simple bitwise language I designed a while back. It is based around Python's bitwise operations. It has several operations most of these are the same or very similar to the equivalent ...
Wheat Wizard's user avatar
  • 98.5k
26 votes
26 answers
2k views

Digital Hardness of Integers

To find the digital hardness of an integer, take its binary representation, and count the number of times both a leading and trailing 1 can be removed until it ...
FlipTack's user avatar
  • 14.7k
16 votes
5 answers
2k views

Binary Convolution

A binary convolution is described by a number M, and is applied to a number N. For each bit in the binary representation of <...
user avatar
10 votes
9 answers
950 views

Super Folding Numbers

We have already defined a folding number here. But now we are going to define a Super Folding Number. A Super Folding number is a number that if folded enough times it will eventually reach one less ...
Wheat Wizard's user avatar
  • 98.5k
37 votes
27 answers
3k views

Folding Numbers

Given a number determine if it is a folding number. A folding number is a number such that if you take it binary representation and "fold" it in half, That is take the result of XNOR ...
Wheat Wizard's user avatar
  • 98.5k
42 votes
29 answers
3k views

Bitflip and negate

Given an integer, make an expression that produces it from 0 using unary negation - and bitwise complement ...
xnor's user avatar
  • 145k
14 votes
22 answers
3k views

Golf bit weaving

Note: the first half of this challenge comes from Martin Ender's previous challenge, Visualize Bit Weaving. The esoteric programming language evil has an interesting operation on byte values which it ...
Leaky Nun's user avatar
  • 49.7k
29 votes
30 answers
4k views

Bit-Reversal Permutations

Your goal is to create a function or a program to reverse the bits in a range of integers given an integer \$n\$. In other words, you want to find the bit-reversal permutation of a range of \$2^n\$ ...
miles's user avatar
  • 16.9k
20 votes
12 answers
2k views

"Bit-borrow" two numbers

Did you know that a small number can borrow bits from a larger number? Here's an example. Let's say our two numbers 5 and 14. First, write them out in binary: ...
DJMcMayhem's user avatar
  • 59.2k
31 votes
44 answers
3k views

Mean bits: an average challenge

Given an integer N >= 1, output the mean number of bits in an integer from 0 to N - 1 Specification The output can be calculated as the sum of the number of bits in the binary representation of each ...
trichoplax is on Codidact now's user avatar
14 votes
9 answers
1k views

Compute CRC32 Hash

Credits This challenge originated from @miles. Create a function that computes the CRC32 hash of an input string. The input will be an ASCII string of any length. The output will be the CRC32 hash of ...
Leaky Nun's user avatar
  • 49.7k
20 votes
23 answers
5k views

Generate a parity bit

A parity bit, is one of the simplest forms of a checksum. First, you have to pick the parity, even or odd. Let's say we pick even. Now, we need a message to transmit. Let's say our message is "...
DJMcMayhem's user avatar
  • 59.2k
24 votes
27 answers
7k views

Split a byte array into a bit array

Write a function that when given a buffer b (1 - 104857600 bytes long) and a number of bits n (1 <= n <= 64), splits the ...
mpen's user avatar
  • 371
22 votes
11 answers
2k views

The XOROR sequence

Cellular Automata are truly fascinating. The ones that are usually talked about are the binary ones, i.e., the ones representable by a number. However, those, in my opinion, have been done to death. ...
Conor O'Brien's user avatar