# Print largest integer you can with the fewest characters [closed]

Find a way to output a large integer with few characters. Solutions will be scored based on the magnitude of the number and shortness of code.

EDIT: Let's impose a time limit of a minute on sensible hardware, where sensible is a PC you can buy off the shelves.

## closed as not a real question by gnibblerJun 19 '12 at 12:01

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question.

• So much for Ackerman(9,9) :P – JPvdMerwe Jan 29 '11 at 12:14
• Note that the results highly depend on the output device (/dev/stdout - slowest since it involves graphics, /dev/null - fastest cause it doesn't do anything, | wc -l - medium). – Alexandru Jan 29 '11 at 17:28
• print '10' - since you haven't specified the base, this is using base-Graham's Number – Skizz Mar 10 '11 at 11:38
• The question should either restrict the size of the code what is the highest number with 100 bytes of code, or enforce a minimum number generate a number, at least 9^1000) as pure digits with as few code as you can. Searching for minimum and maximum the same time would need a conversion function, how to judge on smaller numbers generated with less code, since you cannot ensure that the shortest code will generate the largest number automatically. – user unknown Apr 12 '11 at 0:09
• Voted to close as not constructive. One year, and still no winning criteria. – user unknown Jan 14 '12 at 1:36

Python, 21 characters

print "10"+"^10"*1337


"output a large integer"

It has 10 to the power of 10 repeated 1336 times (Tetration) number of zeros with a leading 1.

Windows x86 .com

8 bytes

B4 02 B2 39 CD 21 EB F8


0xF^0xFFFF