Construct a uInt from an array of bits

Question

Task is simple!
Take an array of binary values (can be boolean, 0/1, etc.) and use those bits to construct an n-th bit long unsigned integer (return type does not need to be an unsigned integer, just a number of any form)
Examples:
[0, 1, 1, 0, 1, 0]
->
26
[true, true, false, true, false, false, true, true, false]
->
422

Functions are treated as the program e.x.

function uint(input) {
   /* code here */
   return result;
}

is the same as

input = getInput();
/* code here */
print(result);

Smallest code in bytes wins

Welcome to the site! Please note that bonuses in code golf are not recommended. You are also making an assumption about language features (they have an explicit Boolean type). — Arnauld, Commented May 16 at 13:05
Sorry about that! I can remove the bonus feature. I noticed that other challenges often had bonuses. — ThePlaneGuy45, Commented May 16 at 13:14
It doesn't need to return an unsigned integer, just a number. I can make that clearer if needed. By unsigned integer I mean it should treat the bits AS an unsigned integer. It does not need to return an unsigned integer, integer, etc. — ThePlaneGuy45, Commented May 16 at 13:16
So it's just "return any value defined by these given bits in your language"? — Someone, Commented May 16 at 13:44

Adám · Accepted Answer · 2024-05-17 05:01:11Z

6

APL (dzaima/APL), 1 byte

⊥

Try it online!

Fun fact: This exact functionality was available in APL's precursor already in 1962.

edited May 17 at 5:01

answered May 16 at 13:19

Adám

31.1k3 gold badges124 silver badges287 bronze badges

Add a comment |

Adám · Accepted Answer · 2024-05-16 14:30:06Z

5

APL+WIN, 17 12, 9, 3 bytes

-5 bytes thanks to Adám.

Prompts for input as either boolean or 'true' 'false' as per original question.

2⊥(↑¨⎕)∊'t'1

Try it online! Thanks to Dyalog Classic

With input restricted to 'true' 'false' reduces to

2⊥'t'=↑¨⎕

and if input restricted to boolean reduces further to

2⊥⎕

edited May 16 at 14:30

Adám

31.1k3 gold badges124 silver badges287 bronze badges

answered May 16 at 13:18

Graham

6,8461 gold badge15 silver badges11 bronze badges

\$\begingroup\$ There's no reason to parse the text form (which isn't a Boolean array anyway) so a simple 2⊥⎕ will suffice. \$\endgroup\$
– Adám
Commented May 16 at 13:19
\$\begingroup\$ But if you really want to, then 2⊥'t'1∊⍨↑¨⎕ is much shorter. \$\endgroup\$
– Adám
Commented May 16 at 13:21
\$\begingroup\$ @Adám Thanks but I am afraid my ancient version of APL+WIN does not support the functionality you have recommended. The first gives a domain error and for the second I do not have the ⍨ operator. \$\endgroup\$
– Graham
Commented May 16 at 13:25
\$\begingroup\$ Fair enough, but 2⊥(↑¨⎕)∊'t'1 is still shorter. That said, (a newer version of) APL+Win does have ⍨, as you can see here. \$\endgroup\$
– Adám
Commented May 16 at 14:08
\$\begingroup\$ @Adám Thanks again. I note the version of APL+WIN you referenced is 19. My ancient version is 5! \$\endgroup\$
– Graham
Commented May 16 at 14:15

| Show 3 more comments

Arnauld · Accepted Answer · 2024-05-16 23:37:38Z

5

JavaScript (ES6), 18 bytes

Expects an array of binary digits.

a=>'0b'+a.join``-0

Try it online!

JavaScript (ES6), 26 bytes

Expects an array of either binary digits or Booleans.

a=>a.map(b=>n=n*2|b,n=0)|n

Try it online!

edited May 16 at 23:37

answered May 16 at 13:07

Arnauld

198k20 gold badges179 silver badges650 bronze badges

Add a comment |

Jitse · Accepted Answer · 2024-05-16 17:31:26Z

4

Python 3, 29 bytes

lambda a:int('%d'*len(a)%a,2)

Try it online!

Python 3, 33 bytes

f=lambda a:a>[]and a.pop()+2*f(a)

Try it online!

-3 bytes thanks to Mukundan314

edited May 16 at 17:31

answered May 16 at 14:12

Jitse

7,7343 gold badges19 silver badges43 bronze badges

\$\begingroup\$ -3 bytes for the recursive variant \$\endgroup\$
– Mukundan314
Commented May 16 at 16:59
\$\begingroup\$ @Mukundan314 brilliant, thanks! \$\endgroup\$
– Jitse
Commented May 16 at 17:31

Add a comment |

badatgolf · Accepted Answer · 2024-05-17 08:56:03Z

4

C (gcc), 38 bytes

-6 bytes thanks to @AZTECCO

f(a,n)int*a;{n=n--?f(a+1,n)|*a<<n:*a;}

Try it online!

A port from this answer. I tried to use memcpy() but to no avail. If someone could do that it will be pretty cool (and also help me from losing sleep).

edited May 17 at 8:56

answered May 16 at 14:42

badatgolf

1,4873 silver badges24 bronze badges

\$\begingroup\$ you'll need to initialize y for the function to be reusable \$\endgroup\$
– att
Commented May 17 at 3:02
\$\begingroup\$ sorry I forgot This \$\endgroup\$
– AZTECCO
Commented May 17 at 8:44

Add a comment |

alephalpha · Accepted Answer · 2024-05-17 02:40:35Z

3

PARI/GP, 15 bytes

a->Pol(a)%(x-2)

Attempt This Online!

Converts the input list to a polynomial, and then evaluates it at x=2.

answered May 17 at 2:40

alephalpha

50k7 gold badges68 silver badges182 bronze badges

Add a comment |

Neil · Accepted Answer · 2024-05-17 05:40:26Z

3

Charcoal, 4 bytes

Ｉ⍘Ｓ²

Try it online! Link is to verbose version of code. Takes input as a string of 0s and 1s from MSB to LSB. Explanation:

  Ｓ     Input string
 ⍘      Base conversion
   ²    Literal integer `2`
Ｉ       Cast to string
        Implicitly print

Alternatively, taking input as an array of bits from MSB to LSB is also 4 bytes:

Ｉ↨Ａ²

Try it online! Link is to verbose version of code. Explanation:

  Ａ     Input array
 ↨      Base conversion
   ²    Literal integer `2`
Ｉ       Cast to string
        Implicitly print

edited May 17 at 5:40

answered May 16 at 15:00

Neil

177k12 gold badges74 silver badges281 bronze badges

Add a comment |

Small-Jaguar · Accepted Answer · 2024-05-17 09:35:49Z

3

Uiua

Without using a builtin (10 bytes):

/+×ⁿ:2⇡⧻.⇌

With builtins (3 bytes):

°⋯⇌

Try it online!

edited May 17 at 9:35

answered May 17 at 9:30

Small-Jaguar

312 bronze badges

\$\begingroup\$ Nice! You can do it without bits in 7 bytes: /+ⁿ:2⊚⇌. Also, in order to use bytes instead of chars, you need to specify how they are being stored as bytes. I have made (and sometimes update) a SBCS (byte encoding system) for Uiua: tinyurl.com/Uiua-SBCS-Apr-12 \$\endgroup\$
– Tbw
Commented May 17 at 18:49

Add a comment |

AZTECCO · Accepted Answer · 2024-05-16 21:21:22Z

2

Ruby, 18 bytes

->b{(b*"").to_i 2}

Try it online!

answered May 16 at 21:21

AZTECCO

10.9k1 gold badge15 silver badges58 bronze badges

Add a comment |

Jonathan Allan · Accepted Answer · 2024-05-17 00:08:15Z

2

Python 2, (17?) 25 bytes

lambda b:int(`b`[1::3],2)

An unnamed function that accepts a non-empty list of integers from \$(0,1)\$ and returns an integer.

Try it online!

If we may accept a non-empty string of 0 and 1 characters, 17 bytes: lambda b:int(b,2)

Python 3, (17?) 28 bytes

lambda b:int(str(b)[1::3],2)

An unnamed function that accepts a non-empty list of integers from \$(0,1)\$ and returns an integer.

Try it online!

If we may accept a non-empty string of 0 and 1 characters, 17 bytes: lambda b:int(b,2)

edited May 17 at 0:08

answered May 16 at 22:17

Jonathan Allan

110k7 gold badges65 silver badges282 bronze badges

Add a comment |

Redz · Accepted Answer · 2024-05-17 01:19:27Z

2

Dart, 78 bytes

int f(var l){int x=0;for(var i=0;i<l.length;i++)x+=(x+l[i]).toInt();return x;}

Needs a list of 0s and 1s to work.

answered May 17 at 1:19

Redz

3692 silver badges11 bronze badges

\$\begingroup\$ Oh hey, welcome to the code golf side of the stack exchange! \$\endgroup\$
– lyxal
Commented May 17 at 22:42
\$\begingroup\$ Aha yes. Hi lyxal! I've descended! (I can't golf very well but I might as well.) \$\endgroup\$
– Redz
Commented May 18 at 1:52

Add a comment |

Someone · Accepted Answer · 2024-05-17 01:40:45Z

2

C++ (gcc), 85 81 80 74 72 bytes (-4 because of badatgolf) (-1) (-6 due to yksisarvinen) (-2 because of badatgolf again)

I'm certain there are ways to optimize this, but I'm pretty proud of it. It takes input as ones and zeros in sequence. (The TIO comes with input.)

#import<iostream>
int x,y;main(){while(std::cin>>x)y+=y+x;std::cout<<y;}

Restrictions (:nerd:)

int is the shortest appropriate type name in C++. This means the program only outputs a positive integer with at most 31 bits, and if there are exactly 32 bits, the integer will be negative as defined by two's complement.

Also, #import is deprecated, and only now do I realize how ridiculous golfing is.

AND there's no int for main. That's TWO WARNINGS.

Try it online!

edited May 17 at 1:40

answered May 16 at 13:24

Someone

3351 silver badge8 bronze badges

1

\$\begingroup\$ 57 bytes if you change your program to use a function instead.Try it online! \$\endgroup\$
– badatgolf
Commented May 16 at 14:11
2

\$\begingroup\$ not really, I just changed the input method and golf up a few parts. I recommend you to look at tips for golfing at C++ and C (for example, you can use #import instead of #include, y*2 instead of y<<1, and so on. \$\endgroup\$
– badatgolf
Commented May 16 at 14:46
1

\$\begingroup\$ my brain told me bitshifts would be better for some reason. \$\endgroup\$
– Someone
Commented May 16 at 15:15
1

\$\begingroup\$ You can get rid of int before main(), gcc will happily accept it with a warning. And moving int x,y before main saves another two bytes, global variables are zero-initialised. \$\endgroup\$
– Yksisarvinen
Commented May 16 at 23:13
1

\$\begingroup\$ @badatgolf as a note , my suggestion for the C answer also works here for 44 \$\endgroup\$
– AZTECCO
Commented May 18 at 7:44

| Show 3 more comments

Kevin Cruijssen · Accepted Answer · 2024-05-17 07:36:45Z

MathGolf, 2 bytes

xä

Try it online.

Could have been 1 byte if we'd be allowed to input as a string instead of bit-array:

å

Try it online.

Explanation:

x   # Reverse the (implicit) input-list
 ä  # Convert from a reversed binary list to a base-10 integer
    # (after which the entire stack joined together is output implicitly as result)

å   # Convert the (implicit) input-string from a binary string to a base-10 integer
    # (after which the entire stack joined together is output implicitly as result)

Don't ask me why ä and â work with reversed binary lists, because I honestly don't know.

Minor note: unlike my 05AB1E answer, a join + convert from binary-string combination as alternative would be 3 bytes instead of 2 in MathGolf, since joining a list of integers/digits will result in a new integer, so an explicit cast to string is necessary (either before or after the join) before å can be used: y░å or ░yå.

Reversed binary lists make more sense if you want to index the list because the bit at index n has value 2ⁿ. — Neil, Commented May 17 at 9:56

doubleunary · Accepted Answer · 2024-05-17 07:54:38Z

2

Google Sheets, 20 bytes

=bin2dec(join(,A:A))

Put the array of bits in column A1:A as zeros and ones, and the formula in cell B1.

edited May 17 at 7:54

answered May 16 at 21:41

doubleunary

2,7131 gold badge2 silver badges12 bronze badges

Add a comment |

Neil · Accepted Answer · 2024-05-17 09:54:30Z

Retina 0.8.2, 9 bytes

+1`¶
$`
1

Try it online! Takes each bit on its own line, MSB first. Explanation:

1`¶
$`

Replace the first newline with the string on the left, thus both doubling it and also concatenating it with the second line.

+`

Repeat until only one line is left.

Count the resulting number of 1s.

Retina 1 can do this with arbitrary precision in 20 bytes:

+`^.+¶(.)
$.($1*_2**

Try it online! Takes each bit on its own line, MSB first. Explanation:

^.+¶(.)
$.($1*_2**

Double the first value and add the second value. ($1*_ converts the second value to unary, 2** is shorthand for 2*$&_ which converts the first value to unary and doubles it, then $.( serves both to take the sum but also to sidestep the unary conversion, doing the arithmetic in decimal.)

+`

Repeat until there is only one value left.

rst · Accepted Answer · 2024-05-17 11:44:34Z

2

MATLAB, 25 bytes

Built-in function bin2dec() takes character arrays, so we need to convert from a logical array.

For golfing, we save a handle to an anonymous function.

f=@(b)bin2dec(char(48+b))

Test

>> f=@(b)bin2dec(char(48+b))
f =
   function_handle with value:
   @(b)bin2dec(char(48+b))

>> bb = '1'==dec2bin( 42 )
bb =
   1×6 logical array
   1   0   1   0   1   0

>> f(bb)
ans =
    42

answered May 17 at 11:44

rst

512 bronze badges

\$\begingroup\$ You can save 1 byte using [... ''] instead of char(...); see here \$\endgroup\$
– Luis Mendo
Commented May 19 at 16:13

Add a comment |

Digital Trauma · Accepted Answer · 2024-05-22 17:53:49Z

2

dc, 4 bytes

2i?p

Reads an array of 0 or 1 chars from stdin.

Try it online!

answered May 22 at 17:53

Digital Trauma

73k9 gold badges112 silver badges264 bronze badges

Add a comment |

Xcali · Accepted Answer · 2024-05-22 19:24:13Z

2

Perl 5 `-p`, 12 bytes

$_=oct"0b$_"

Try it online!

answered May 22 at 19:24

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

Add a comment |

Sylvester is on codidact.com · Accepted Answer · 2024-05-24 20:34:29Z

2

TI-BASIC, 30 28 27 bytes

Removed 2 bytes thanks to MarcMush
Removed 1 more byte thanks again to MarcMush

Input A
dim(ʟA
Σ(2^(Ans-I)ʟA(I),I,1,Ans

Takes an array of bits as input, and outputs the converted unsigned integer. Here are the example inputs and outputs used in the challenge:

An interesting side effect of this particular algorithm is that the numbers in the input list don't have to be binary digits for the code to complete successfully.

edited May 24 at 20:34

answered May 17 at 11:02

Sylvester is on codidact.com

7372 silver badges14 bronze badges

1

\$\begingroup\$ you should be able to use Ans instead of D to save 2 bytes \$\endgroup\$
– MarcMush
Commented May 17 at 17:28
\$\begingroup\$ Also one more byte by using a different list name codegolf.stackexchange.com/a/143898 \$\endgroup\$
– MarcMush
Commented May 22 at 11:05
\$\begingroup\$ @MarcMush Unfortunately, those shorter list names don't work when modifying an item of the list. To quote the answer, "1→ᶫA(3 cannot be changed to 1→A(3" :/ \$\endgroup\$
– Sylvester is on codidact.com
Commented May 22 at 14:59
\$\begingroup\$ I mean Input A instead of Input L₁. Then of course you need to call then elements with ᶫA(I) but it's the same amount of bytes since L₁ is 2 bytes \$\endgroup\$
– MarcMush
Commented May 24 at 15:56
\$\begingroup\$ Ohh I see, thanks! I'll update it \$\endgroup\$
– Sylvester is on codidact.com
Commented May 24 at 20:31

Add a comment |

Alt Shift X · Accepted Answer · 2024-05-16 17:17:45Z

1

Funge-98, 20 bytes

&:1j3_\.@j3:-1\+&*2\

Try it online!

First reads the length of the array, then reads the array itself as a series of binary digits.

answered May 16 at 17:17

Alt Shift X

3011 silver badge4 bronze badges

Add a comment |

Kevin Cruijssen · Accepted Answer · 2024-05-17 07:31:05Z

05AB1E, 2 bytes

2β

Try it online or verify all test cases.

Or alternatively:

JC

Try it online or verify all test cases.

Could have been 1 byte if we'd be allowed to input as a string instead of bit-array:

Try it online or verify all test cases.

Explanation:

2β  # Convert the (implicit) input-list from a base-2 list to a base-10 integer
    # (after which this integer is output implicitly as result)

J   # Join the (implicit) input-list together
 C  # Convert it from a binary string to a base-10 integer
    # (after which this integer is output implicitly as result)

C   # (same as above, but on the input-string directly without a `J`oin beforehand)

Julian · Accepted Answer · 2024-05-24 03:57:49Z

1

PowerShell Core, 21 bytes

$args|%{$s+=$_+$s}
$s

Try it online!

Takes an array, returns an integer

answered May 24 at 3:57

Julian

3,2467 silver badges17 bronze badges

Add a comment |

MarcMush · Accepted Answer · 2024-05-24 16:18:31Z

1

TI-Basic, 13 bytes

sum(Ans2^(dim(Ans)-cumSum(Ans!

takes input as Ans (last result)

answered May 24 at 16:18

MarcMush

6,63513 silver badges17 bronze badges

Add a comment |

david · Accepted Answer · 2024-08-08 16:18:55Z

1

Forth (gforth), 55 bytes

: a 2 BASE ! DEPTH 1 +DO SWAP I LSHIFT + LOOP DECIMAL ;

Try it online!

Assuming we start with DECIMAL base and return to it.

answered Aug 8 at 16:18

david

6094 silver badges13 bronze badges

Add a comment |

xrs · Accepted Answer · 2024-12-05 06:08:08Z

1

AWK, 42 bytes

{for(i=NF;i;i--)s+=x?($i*2)^(x++):x++}$0=s

Attempt This Online!

answered Dec 5 at 6:08

xrs

5794 bronze badges

Add a comment |

Stack Exchange Network

Construct a uInt from an array of bits

25 Answers 25

APL (dzaima/APL), 1 byte

APL+WIN, 17 12, 9, 3 bytes

JavaScript (ES6), 18 bytes

JavaScript (ES6), 26 bytes

Python 3, 29 bytes

Python 3, 33 bytes

C (gcc), 38 bytes

PARI/GP, 15 bytes

Charcoal, 4 bytes

Uiua

Ruby, 18 bytes

Python 2, (17?) 25 bytes

Python 3, (17?) 28 bytes

Dart, 78 bytes

C++ (gcc), 85 81 80 74 72 bytes (-4 because of badatgolf) (-1) (-6 due to yksisarvinen) (-2 because of badatgolf again)

Restrictions (:nerd:)

MathGolf, 2 bytes

Google Sheets, 20 bytes

Retina 0.8.2, 9 bytes

dc, 4 bytes

Perl 5 `-p`, 12 bytes

TI-BASIC, 30 28 27 bytes

Funge-98, 20 bytes

05AB1E, 2 bytes

PowerShell Core, 21 bytes

TI-Basic, 13 bytes

Forth (gforth), 55 bytes

AWK, 42 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
number
integer
binary
encoding
or ask your own question.

Linked

Hot Network Questions

25 Answers 25

APL (dzaima/APL), 1 byte

APL+WIN, 17 12, 9, 3 bytes

JavaScript (ES6), 18 bytes

JavaScript (ES6), 26 bytes

Python 3, 29 bytes

Python 3, 33 bytes

C (gcc), 38 bytes

PARI/GP, 15 bytes

Charcoal, 4 bytes

Ruby, 18 bytes

Python 2, (17?) 25 bytes

Python 3, (17?) 28 bytes

Dart, 78 bytes

C++ (gcc), 85 81 80 74 72 bytes (-4 because of badatgolf) (-1) (-6 due to yksisarvinen) (-2 because of badatgolf again)

Restrictions (:nerd:)

MathGolf, 2 bytes

Google Sheets, 20 bytes

Retina 0.8.2, 9 bytes

dc, 4 bytes

Perl 5 -p, 12 bytes

TI-BASIC, 30 28 27 bytes

Funge-98, 20 bytes

05AB1E, 2 bytes

PowerShell Core, 21 bytes

TI-Basic, 13 bytes

Forth (gforth), 55 bytes

AWK, 42 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfnumberintegerbinaryencoding or ask your own question.

Linked

Related

Perl 5 `-p`, 12 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
number
integer
binary
encoding
or ask your own question.