Hack into a Lottery

Question

You've recently made an account on a dodgy gambling site, where for a fee of 25 dollars, they will pay you back a random amount between 0 and 50 dollars. After getting around 5 dollars twice, you decide to prove the site is a scam. After accessing their external firewall with the default password, you find your way onto their database server, and find where the values for the minimum and maximum amounts are held. You decide to plug 25 '9's in as the maximum value, but get an error message saying the maximum value must be of type 'uint64'. However it is now that you notice some number keys don't seem to type into the remote console correctly. The challenge appears before you almost as if typed up on a Q+A site.

using only the conveniently installed programs for testing and executing your particular language, output the maximum size of an unsigned 64-bit integer value, however almost everything except the programming tools are broken on this machine, leaving you without the use of the numbers 1,2,4,6,8 - in either source code or literals, you also notice that it seems to take an exponentially longer amount of time to execute the program for each additional piece of code, so you'd better keep it short if you want to get rich before the drawing!

The Challenge

Write a program which outputs 18446744073709551615, the maximum value of an unsigned 64-bit integer, as either a number, or a single string.
Your source code cannot contain any of the characters '1','2','4','6' or '8'
if your language does not have an unsigned 64-bit integer or equivalent, the output can be in string format or otherwise, but must be the above number.
this is code-golf so shortest code in each language wins!

@user902383 must be in the exact format, feel free to parse it as a hex number, as long as the output is in normal decimal notation. — colsw, Feb 21, 2017 at 14:16
I love the story lol. More challenges need a backstory like this — Cruncher, Feb 22, 2017 at 14:40
So now that there are many solutions to choose from, was the gambling site a fraud? — Tominator, Feb 23, 2017 at 10:32

Wilfred Hughes · Accepted Answer · 2017-02-26 17:37:19Z

1

Rust, 43 42 31 bytes

fn main(){print!("{}",!0usize)}

This isn't portable code (assumes a 64-bit architecture), but I can't use the u64 type due to its name containing forbidden characters.

edited Feb 26, 2017 at 17:37

answered Feb 25, 2017 at 15:30

Wilfred Hughes

1114 bronze badges

\$\begingroup\$ I think you can remove the space after the comma. \$\endgroup\$
– Conor O'Brien
Feb 26, 2017 at 4:17
\$\begingroup\$ Oh, beginner mistake! Thanks, updated :) \$\endgroup\$
– Wilfred Hughes
Feb 26, 2017 at 15:31

Add a comment |

PidgeyUsedGust · Accepted Answer · 2017-03-14 16:42:59Z

1

><>, 17 15 bytes

Updates

Replaced ab-- with i+ to achieve -1.

b5+:*:*:*:*i+n;

Try it online!

The idea is to factor 16¹⁶ into (((16²⁾²)²)², which can be easily computing by duplicating the stack and multiplying :*.

Explanation

b5+:*:*:*:*i+n;

b                     Push 11
 5                    Push 5
  +                   Add to make 16
   :*                 Square  ->  16²
     :*:*:*           .. another 3 times to make
                           16¹⁶ = (((16²)²)²)²
           i          Push -1 because no input
            +         16¹⁶ + (-1) = 16¹⁶-1
             n;       Print and Exit

edited Mar 14, 2017 at 16:42

answered Feb 27, 2017 at 10:41

PidgeyUsedGust

6695 silver badges7 bronze badges

\$\begingroup\$ 14 bytes \$\endgroup\$
– emirps
Dec 7, 2022 at 15:53

Add a comment |

score 1 · Accepted Answer · 2017-05-01 16:36:00Z

1

Brain-Flak, 122 bytes

(()())({({})({}[()])}{})({({})({}[()])}{})({({})({}[()])}{})({({})({}[()])}{})({({})({}[()])}{})({({})({}[()])}{})({}[()])

Try it online! Also works in Mini-Flak

edited May 1, 2017 at 16:36

answered May 1, 2017 at 15:45

user68718

\$\begingroup\$ You can shorten this. Instead of 2^2^2, you can use 4*2*2 to get 16. (((()()()()){}){}). That's 24 Bytes shorter \$\endgroup\$
– Dorian
Jul 23, 2018 at 14:52

Add a comment |

Dorian · Accepted Answer · 2018-07-26 13:26:38Z

1

Java, 92 Bytes :-D

class a{public static void main(String[] a){System.out.print(Long.toUnsignedString(-3/3));}}

answered Jul 26, 2018 at 13:26

Dorian

3,03513 silver badges12 bronze badges

Add a comment |

lyxal · Accepted Answer · 2020-05-20 11:53:14Z

1

Keg, 6 bytes

\∑\@Ë;

Try it online!

answered May 20, 2020 at 11:53

lyxal

33.3k2 gold badges60 silver badges139 bronze badges

Add a comment |

Conor O'Brien · Accepted Answer · 2020-11-24 01:33:03Z

1

Attache, 12 bytes

{$`e^$`G-!0}

Try it online!

Uses Attache's inbuilt number compression literals. $`<string> decompresses <string> into a number. In this case, e maps to 4, and G to 32. Another solution would be to replace both with $`q, which maps to 16. We subtract 1, which can be calculated as !0, or \$0!\$. This is a lambda returning the appropriate value.

answered Nov 24, 2020 at 1:33

Conor O'Brien

40.1k3 gold badges90 silver badges178 bronze badges

Add a comment |

user36046user36046 · Accepted Answer · 2020-12-31 17:53:32Z

1

x86_64 machine code (Linux), 7 bytes

00000000: 4831 c048 f7d0 c3                        H1.H...

Assembly (NASM):

section .text
global func
func:
xor rax, rax
not rax
ret

Try it online!

answered Dec 31, 2020 at 17:53

user36046

\$\begingroup\$ xor rax, rax => xor eax, eax as upper32 is automatically zeroed \$\endgroup\$
– l4m2
Dec 15, 2022 at 4:43

Add a comment |

pacman256 · Accepted Answer · 2022-10-05 13:28:10Z

1

Vyxal, 4 bytes

kḭ²‹

Try it Online!

2^32 squared, minus one.

answered Oct 5, 2022 at 13:28

pacman256

3,7601 gold badge7 silver badges30 bronze badges

1

\$\begingroup\$ ₆E‹ for -1 byte \$\endgroup\$
– emanresu A
Nov 8, 2022 at 23:23

Add a comment |

Seggan · Accepted Answer · 2022-11-08 16:05:47Z

1

Fig, \$7\log_{256}(96)\approx\$ 5.762 bytes

{^{3C/@

Try it online!

{^{3C/@
  {3    # 3 - 1
 ^      # To the power of
    C/     # The charcode of
      @    # '@' (64)
{       # Decremented

edited Nov 8, 2022 at 16:05

answered Nov 7, 2022 at 16:20

Seggan

5,31721 silver badges47 bronze badges

Add a comment |

VFDan · Accepted Answer · 2023-06-07 04:50:40Z

1

JavaScript, 34 25 bytes (courtesy of l4m2)

(a=BigInt(9+7))**a-a/a+''

Works in any console that supports BigInts.

edited Jun 7, 2023 at 4:50

answered May 19, 2020 at 19:46

VFDan

2533 silver badges12 bronze badges

\$\begingroup\$ 27 \$\endgroup\$
– l4m2
Dec 15, 2022 at 4:48
\$\begingroup\$ 25 \$\endgroup\$
– l4m2
Dec 15, 2022 at 4:49

Add a comment |

Daniel · Accepted Answer · 2017-02-21 16:12:20Z

0

Python, 19 bytes

In REPL

int('3'*(35-3),7-3)

Not in REPL

print int('3'*(35-3),7-3)

answered Feb 21, 2017 at 16:12

Daniel

6,7191 gold badge20 silver badges58 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Pyke, 5 bytes

Zw`@t

Try it here!

 w`   -   64
Z  @  -  set_bit(0, ^)
    t - ^ -1

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 21, 2017 at 17:32

Blue

28.6k8 gold badges51 silver badges100 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

MUMPS, 15 bytes

w 9+7**(9+7)-'0

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 22, 2017 at 0:56

psr

1212 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

SmallTalk – 60 characters

Transcript show:(((7+9)raisedTo:(7+9))-(3/3))printString;cr.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 22, 2017 at 3:08

user15259

Add a comment |

Neil · Accepted Answer · 2017-02-22 11:24:49Z

0

Batch, 64 59 58 54 bytes

@set a=@cmd/cset/a
%a%0xafebff0
%a%737095
%a%0xc99f

Port of my JavaScript answer. Edit: Saved 5 bytes thanks to @Arnauld.

edited Feb 22, 2017 at 11:24

answered Feb 21, 2017 at 12:02

Neil

170k12 gold badges72 silver badges275 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

SmileBASIC, 35 bytes

?POW(!.+!.,#X)LOCATE #A,0?ASC("x")

x should be replaced with CHR$(1615)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 23, 2017 at 13:54

12Me21

6,6811 gold badge22 silver badges40 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Groovy, 28 Bytes

{++(Long.MAX_VALUE/0.5)}

Try it: https://groovyconsole.appspot.com/edit/5145694419550208

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 23, 2017 at 19:41

Magic Octopus Urn

20.7k4 gold badges61 silver badges136 bronze badges

Add a comment |

anna328p · Accepted Answer · 2017-02-24 22:29:21Z

0

Ruby, 18 bytes

p (9+7)**(9+7)-7/7

edited Feb 24, 2017 at 22:29

answered Feb 21, 2017 at 20:47

anna328p

6,3762 gold badges31 silver badges63 bronze badges

\$\begingroup\$ Would (9+7)**(9+7) save you a byte? \$\endgroup\$
– Neil
Feb 21, 2017 at 22:49

Add a comment |

Kamila Szewczyk · Accepted Answer · 2020-05-20 12:25:37Z

0

asm2bf, 9 bytes

Function body assuming r1 = 0, returns the desired value in r1.

decr1
ret

answered May 20, 2020 at 12:25

Kamila Szewczyk

12.4k1 gold badge29 silver badges60 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2020-11-20 18:23:14Z

0

Japt, 10 bytes

GîGpG)+#¡5

Try it

GîGpG)+#¡5
G              :16
 î             :Slice the following to that length
  GpG          :  16**16
     )         :End slice
      +        :Append
       #¡5     :1615

edited Nov 20, 2020 at 18:23

answered Nov 20, 2020 at 18:16

Shaggy

41.9k4 gold badges34 silver badges93 bronze badges

Add a comment |

Kevin Cruijssen · Accepted Answer · 2020-11-23 15:59:57Z

Whitespace, 61 bytes

[S S S T    S N
_Push_2][S N
S _Duplicate][T S S N
_Multiply][S N
S _Duplicate][T S S N
_Multiply][S N
S _Duplicate][T S S N
_Multiply][S N
S _Duplicate][T S S N
_Multiply][S N
S _Duplicate][T S S N
_Multiply][S N
S _Duplicate][T S S N
_Multiply][S S S T  N
_Push_1][T  S S T   _Subtract][T    N
S T _Print_as_integer]

Letters S (space), T (tab), and N (new-line) added as highlighting only.
[..._some_action] added as explanation only.

Try it online (with raw spaces, tabs and new-lines only).

Explanation:

Pretty straight-forward:

Push 2
Square itself six times
Decrease by 1
Output as integer

Pushing and outputting the expected integer in one go would be 72 bytes instead.

chunes · Accepted Answer · 2022-11-07 16:57:38Z

0

Factor (Windows only), 14 bytes

GPTR on-bits .

Only works on Windows (and hence not on TIO/ATO). Not sure whether that's allowed or not.

GPTR is a constant equal to 64 loaded on machines running Windows. on-bits takes a value and creates a number with that many on bits.

answered Nov 7, 2022 at 16:57

chunes

24k3 gold badges21 silver badges51 bronze badges

Add a comment |

Seggan · Accepted Answer · 2022-12-15 02:45:05Z

0

Fig, 17 bytes (UTF-8)

OC"䠎ᴐ᳊╏ɧ

Try it online!

Fig doesn't have too much in the way of number builtins, so here is a charcode version. Just get the charcode of each character, then join.

answered Dec 15, 2022 at 2:45

Seggan

5,31721 silver badges47 bronze badges

Add a comment |

l4m2 · Accepted Answer · 2022-12-15 04:42:29Z

0

C (gcc), 9 bytes

-Df()0UL-

Try it online!

Tech used before

answered Dec 15, 2022 at 4:42

l4m2

23.9k2 gold badges23 silver badges91 bronze badges

Add a comment |

Kip the Malamute · Accepted Answer · 2022-12-17 01:50:28Z

0

Pyt, 5 bytes

3⁻⁸⁸⁻


3⁻     pushes 3, then decrements
  ⁸    raises to the 8th power
   ⁸   8th power again
    ⁻  decrement
       implicit print

Try it online!

answered Dec 17, 2022 at 1:50

Kip the Malamute

1,6872 silver badges13 bronze badges

Add a comment |

emirps · Accepted Answer · 2023-03-02 15:45:55Z

0

Gol><>, 8 bytes

"@"XMn;

Try it online!

The unprintable is char 0x02

Explanation

".@"XMn; # whole program
".@"     # 0x02, 64
    X    # e`X`ponentiate
     m   # -1
      n  # output
       ; # terminate execution

answered Mar 2, 2023 at 15:45

emirps

1,7975 silver badges15 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2023-03-02 16:31:50Z

Thunno, \$ 10 \log_{256}(96) \approx \$ 8.23 bytes

aeaA,D^nA~

Attempt This Online!

No numbers at all!

Explanation

aeaA,D^nA~  #                           STACK:
ae          # Constant for 160          160
  aA        # Constant for 10           160, 10
    ,       # Integer divide            16
     D^     # To the power of itself    18446744073709551616
       n    # Negate                    -18446744073709551616
        A~  # Bitwise not               18446744073709551615
            # Implicit output

emirps · Accepted Answer · 2023-03-17 13:14:32Z

0

Stax, 4 bytes

VuJv

Run and debug it

Unpacked and packed it's 4 bytes

Explanation

Vu   # 2**32
  J  # squared
   v # -1

answered Mar 17, 2023 at 13:14

emirps

1,7975 silver badges15 bronze badges

Add a comment |

pxeger · Accepted Answer · 2024-01-21 17:38:03Z

0

Zsh, 27 bytes

!
<<<$?$[35#ULOSOKRBNKG]$?5

Attempt This Online!

Zsh only allows signed 64 bit integers, so we need a string method. Notice that ULOSOKRBNKG is 84467440737095516 in base 35, and contains no disallowed characters. Then we just need to attach two 1s and a 5: 5 is an allowed digit anyway, and we can get 1 by running a command that fails (in this case !) and taking its exit status in $?.

answered Jan 21 at 17:38

pxeger

23.7k4 gold badges52 silver badges137 bronze badges

Add a comment |

iwaseatenbyagrue · Accepted Answer · 2017-02-27 14:46:20Z

-1

Python, 20 (or 26) bytes

(5-3)**ord('@')-3**0

ord('@') is equal to 64.

The full function/programme (@BusinessCat, I hope this is more in line with what is expected) would add 6 bytes:

print (5-3)**ord('@')-3**0

The 26 byte version would work if we wanted to pipe the output:

python -c "print (5-3)**ord('@')-3**0"

The 20 byte version would not.

edited Feb 27, 2017 at 14:46

answered Feb 27, 2017 at 12:07

iwaseatenbyagrue

2311 silver badge5 bronze badges

1

\$\begingroup\$ This is a snippet, every submission needs to be a full program or function. \$\endgroup\$
– Business Cat
Feb 27, 2017 at 14:19
\$\begingroup\$ you can do 3/3 instead of 3**0 and you can remove the space after print to save 2 bytes \$\endgroup\$
– Sagittarius
May 20, 2020 at 9:35

Add a comment |

Hack into a Lottery

The Challenge

90 Answers 90

Rust, 43 42 31 bytes

><>, 17 15 bytes

Updates

Explanation

Brain-Flak, 122 bytes

Java, 92 Bytes :-D

Keg, 6 bytes

Attache, 12 bytes

x86_64 machine code (Linux), 7 bytes

Vyxal, 4 bytes

Fig, \$7\log_{256}(96)\approx\$ 5.762 bytes

JavaScript, 34 25 bytes (courtesy of l4m2)

Python, 19 bytes

Pyke, 5 bytes

MUMPS, 15 bytes

SmallTalk – 60 characters

Batch, 64 59 58 54 bytes

SmileBASIC, 35 bytes

Groovy, 28 Bytes

Ruby, 18 bytes

asm2bf, 9 bytes

Japt, 10 bytes

Whitespace, 61 bytes

Factor (Windows only), 14 bytes

Fig, 17 bytes (UTF-8)

C (gcc), 9 bytes

Pyt, 5 bytes

Gol><>, 8 bytes

Explanation

Thunno, \$ 10 \log_{256}(96) \approx \$ 8.23 bytes

Explanation

Stax, 4 bytes

Explanation

Zsh, 27 bytes

Python, 20 (or 26) bytes

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions

Not the answer you're looking for? Browse other questions tagged
code-golf
number
kolmogorov-complexity
restricted-source
or ask your own question.