StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

Falk Hüffner

Rating
1553.46 (6,999th)
Reputation
3,591 (46,847th)
Page: 1 2 3
Title Δ
How to change if the i th bit is 1,replace with (i+1) bit in python? -1.77
List [0-1] to binary representation fast -0.21
How to efficiently add two JS numbers that are bit representation o... +0.43
Efficient computation of the average of three unsigned integers (wi... +1.03
Insert a bit in a byte at pos n with Assembly -0.28
Efficient search for an element other than the one used for orderin... -0.20
How to create two XORable lists from a main list in python? -0.49
Check if the difference between two unsigned integers is at most 1 -0.80
Test if all higher bits are set -0.62
How to simplify this "clear multiple bits at once" functi... 0.00
Generating prefix bitmasks +0.79
Subtract 1 digit integer -0.17
Generic rules to build numeric multipliers from truth tables +1.90
Finding all numbers which are less than a given no with less no of... -0.06
getting specific k bits from a Decimal number -0.56
How to remove the nth hexadecimal digit of a integer number without... +1.70
Check whether the input is the largest 2's complement integer -1.05
Is it possible to test if a number is either even or '1', u... -1.15
Subtracting packed 8-bit integers in an 64-bit integer by 1 in para... -0.13
Constraining numbers to a range based on a MASK and a COMPARE regis... 0.00
How to shift left one specific bit? 0.00
Efficiently dropping 2 bits from a 32bit data type -1.73
Unpacking a stream of values of bit size not divisible by 8 -0.08
Algorithm for finding the smallest +ve integer greater than a given... +1.21
Detect 0xff in multibyte word with bitwise operations -1.96
Why Z3 falling at this? 0.00
How do I find the most dominant bit of a position in the given set... 0.00
Simplify bitwise operation 0.00
generate BZHI instruction with gcc 0.00
Data structure for subset-reduced growing list 0.00
Bit manipulation in a range -2.72
More efficient way of finding edit distance over a large array -0.05
Number of 0's in a sorted boolean n*n matrix in log(n) time +2.53
Counting zero b-bit subsequences in a byte array +3.55
N choose K bit permutation with bitmask 0.00
How to evaluate zero sets fast? +1.67
Fast way to generate pseudo-random bits with a given probability of... -0.65
need to shift bits in number using bitwise operators? +4.44
Genetic Algorithm or Simulated Annealing for Work Project Schedulin... 0.00
Getting the best combination of closest pairs between 2 sets of poi... +2.99
Most efficient way of creating a 32 bit bitmask +3.29
Get second most significant bit of a number +3.46
How to generate all integers i, n & i == n (keeping bit length) +4.44
C# How to remove the n-th bit in integer? -1.64
Is there a cheap way to "mirror" the bits in a byte? +3.85
Compare "if between" with bitwise operators instead of lo... -4.51
Seeking a graph algorithm: how to make the graph happy? -3.37
Algorithm for packing time slots -2.37
Different value for every int variable +1.78
What's the minimum number of edges a graph needs to have for it... +4.00