147

C - 2,739,341,494,945,868,415,002 (Not including whitespace) Brute force for the win. Only handles integers, and preserves overflow behavior. Here's a snippet of the code: int addnumbers(int x, int y) { if (x == -2147483648 && y == -2147483648) return 0; if (x == -2147483648 && y == -2147483647) return 1; if (x == -2147483648 &...


49

Python 3, 82 87 88 Thanks to @JonathanAllan for +1 score print("g!#$%&'*n+,./012i34579;<l=>?@ADEwFGHIJKLoMNOPQRSBTUVWXYZ ^_`abchejkmqsuvdyz{|}~ \x6f C"[::-8]) Try it online! Nothing special, just slicing and skipping characters. The string is reversed so you can't remove characters and have the original string being printed.


37

Glypho, 94 The source file is encoded in CP437. ␀␀!"☺☺#$☻♥♥☻♦♣♦♣%♠♠&•◘•◘'○○(◙♂◙♂♀♪♪♀♫☼♫☼►◄◄►↕↕)*‼¶¶‼§§+,▬↨↨▬↑↓↑↓→←→←∟∟-.↔▲▲↔/▼▼▼⌂Ç⌂Çüééüââ01ää23àååàçêçê4ëë5èïèïîî67ìÄÄì8ÅÅ9ÉÉ:;æÆÆæô<=ôöòòöûùûù>ÿÿÿÖÖ?@ÜÜAB¢££¢¥₧¥₧CƒƒDáíáíóóEFúññúѪѪGººHI¿¿J⌐¬⌐¬K½½½¼¼LM¡««¡N»»»░░OP▒▒QR▓││▓┤╡┤╡S╢╢T╖╕╖╕U╣╣V║╗║╗╝╜╜╝W╛╛╛┐X┐┐Y└└└┴┬┴┬├─├─Z┼┼┼╞╞[\╟╟]^╚╔╔╚╩╦╩╦_╠╠`═╬═╬╧╨╨╧╤...


36

Keg, \$3.3 \times 10^{8912898}\$ bytes ...÷⅍+ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,⅍+ℤ,⅍+ℤ,⅍+ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,(􏿿|⅍+)ℤ,⅍+ℤ, Program as seen in the raw editor So where that ... is, replace it with \$3.3 * 10^{8912898}\$ 0s. Then, add a ! after those 0s. This splits the number into chunks, divides these chunks by 􏿿 and outputs them. I owe a ...


32

Haskell, 39 45 50 52 60 bytes main=do{(\𤶸 陸 ⵙ 商 ߜ 新->pure fst)LT EQ[]3 2$1} Identifier main has to have type IO a for some type a. When the program is executed, the computation main is performed, and its result is discarded. In this case its type is IO ((a,b)->a). The result is an application of the function (λ a b c d e f → return fst),...


29

APL (Dyalog Unicode), \$ \approx (10 \uparrow)^{625} 10.024549 \gg 10 \uparrow \uparrow 626 \$ bytes ⎕UCS(13⌿*⌿2+|⊃⎕RL⊣⎕RL←⍪⍨1)⊤≢⍬⍬⍬... The exact byte count is $$ \text{byte count before zilde} + \text{byte count of single zilde} \times \text{length of zilde chain} \\ = 52 + 3 \times (72x^{12} + 101x^{11} + 108x^{10} + 108x^9 + \\ 111x^8 + 44x^7 + 32x^6 + ...


27

Jelly, 253 254 256 bytes M“¢£¥¦©¬®µ½¿€ÆÇÐÑ×ØŒÞßæçðıȷñ÷øœþ !"#%&'()*+,-./0145689:;<=>?@ABCDEFGHIJKNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|~¶°¹²³⁴⁵⁶⁷⁸⁹⁺⁻⁼⁽⁾ƁƇƑƓƘⱮƝƤƬƲȤɓƈɗƒɠɦƙɱɲƥʠɼʂƭʋȥẠḄḌẸḤỊḲḶṂṆỌṚṢṬỤṾẈỴẒȦḂĊḊĖḞĠḢİĿṀṄȮṖṘṠṪẆẊẎŻḅḍẹḥịḳḷṃṇọṛṣṭụṿẉỵẓȧḃċḋėḟġḣŀṁṅȯṗṙṡṫẇẋẏż”L»«’Ɗạ‘}237$¤¡ Try it online! or Verify it! Turns out golfing languages can bowl....


26

Python 2,  20 21 33 39 45  50 bytes Now very much a collaborative effort! +2 thanks to Aidan F. Pierce (replace sorted({0}) with map(long,{0})) +8 thanks to dylnan (use of \ and newline to replace space; suggestions to move from 0 to a mathematical expression; replacing -1 with -True; use of hexadecimal) +11 thanks to Angs (4*23+~91 -> ~4836+9*1075/2 then ...


22

Python 3, 44619 8.13*1011515 ~\$10^{10^{5749}}\$ bytes The program itself is rather too large to fit in the observable universe on Stack Overflow, so this is a link to a program that can generate it... if you change the rather large number generator to a ~9 instead. Try it online! This can certainly be longer, but I'm going to post it now since I'm not ...


21

Piet, Score Uncertain (153ish) I understand that this doesn't strictly fit within the specifications (requiring ASCII art), however the source code does provide a very readable DFTBA. The trace is below. Piet ignores every colour that doesn't mean anything. As a result, I used gray as the generic "comment colour" to outline and the like. The gray doesn't ...


21

C++, 3573 3573, then it was getting boring, but I can continue adding more layer of abstraction. #include <iostream> #include <vector> class Number { public: typedef int Representation; class InvalidNumber { }; Number(); Number( const InvalidNumber& invalid ); explicit Number( const Representation& v ); friend ...


21

CJam, 1.17 × 10678 bytes ",,,",KK#b:c~ Well, the string should actually contain 1,167,015,602,222,203,651,546,923,533,233,456,645,527,427,020,625,754,322,603,554,937,551,735,592,092,356,520,085,507,613,447,896,812,875,213,856,544,974,386,642,866,232,121,069,637,599,975,236,272,634,227,913,998,493,360,693,139,149,236,571,503,883,331,020,249,908,672,008,574,...


21

JavaScript (ES6), N = 5 With a leading newline instead of a trailing newline. alert ((a=` `+!!0 )+a+a +a+a) JavaScript (ES6), N = 6 alert( (1e5+` `)['r' +'epe\ '+'at\ '](6)) JavaScript, N = 7 this['\ consol\ e'].log ('1234\ 567\n'[ 'repea\ t'](7)) JavaScript, N = 202 [][(![]+[])[+[[[[[]]]]]]+([![]]+[][[]])...


20

JS I know it's still being contested, but I thought I'd have a go: (function (){a=''; a ; a= ' '; h = '#' ; s = ' ' ; s ; s ; s ; s ; s ; s ; s ; s ; ...


19

><>, 92 94 YAY, I DID IT! ␑ is the exotic character \x11 with decimal value 17. The program exits with an error after printing the result (it's a stack underflow). I had to manage which mirrors and directional commands I used carefully, since I can only use each one once. >"vCoUV␑3`h]Z_X /a[f+ #$%&'r(! .0456~8? :;<=@9l) ...


18

Lenguage, 1,112,064 points if UTF-8 My program consists of every possible UTF-8 character. It prints out "Hello world", and uses 1.75 * 1076 yottabytes of space. (To generate the program, you simply need to make a file with 17498005810995570277424757300680353162371620393379153004301136096632219477184361459647073663110750484 characters, ensuring ...


18

C (tcc), x86_64, 29 31 33 39 40 bytes main[]={(23*8),-~0xABEDFCfebdc%95674+1}; Returns 0. Thanks to @feersum for suggesting uppercase hex digits. Try it online! How it works The assignment writes two ints (184 and 49664) to the memory location of main. With 32-bit ints and little-endian byte order, the exact bytes are b8 00 00 00 00 c2 00 00. Since ...


17

Malbolge (71 80 x 10) / 32 + 25 + 94 = 141.1875 144 Update: added more spacing between the letters to raise the score. Tested with the official Malbolge interpreter. Of course, it's really not hard to print static text using Malbolge. The encoding used by Malbolge almost guarantees you'll have the whole set of printable ASCII characters in there. bCBA@?...


17

Dart's Hello World compiled to JS (2 936 012) http://code.google.com/p/dart/issues/detail?id=14686 (I'll let Google justify it, though)


17

on the Dyalog APL terminal abcde fghij outputs VALUE ERROR


17

Perl - 96 (Pretty good, given the theoretical max 97 score) s{}[Hel0o, w3$=d!];y<"#%&'*.124578:?@BCDEFGIJKLMNOQ/-9>( 6PRSTUVWXYZ^_`abfghjmqvxz|~\cAk-u)+print (Note that second line starts with an actual \t tab character) The code is 98 characters long and contains every ascii char exactly once, plus an extra -. 98 - 2 = 96 There are no ...


16

Octave, 20 21 22 25 27 33 The best I've managed this far is g=@()disp(horzcat([67 9583 -412],'e B',"nvkhmf"+!0)); This creates an anonymous function f that takes no input. You can call it f(). I'd say the semicolon at the end is necessary, in order to avoid printing of the function body. It is possible this can be improved by combining eval and printf, ...


16

C, 231 Program A i[]={'','','','','','','',',' ',' ',' ','','','','','','','','','','','','','','','','','','',' ','!','"','#','$','%','&','\'','(',')','*','+',',','-','.','/','0','1','2','3','4','5','6','7','8','9',':',';','<','=','>','?','@','A','B','C','D','E','...


16

><>, 122 bytes e"~l=?!z6-d0p}xwutsrqonmkjihgfcba`_]\[>ZYXWVUTSRQPONMLKJIHGFEDCB@<:98754321/,+*)('&%$# . |{Ay Try it online! Does nothing. Based on the same format as my Programming a Pristine World ...


15

Python, 176 bytes Not a bowler, but... import sys,fractions def f(t): c=0 for i in range(t+10): for j in range(1,i): if fractions.gcd(j,i)==1:c+=1 if c==t:return str(j)+'/'+str(i) print f(int(sys.argv[1]))


14

Many languages, 2 points 0. Produces 0.0 as 0. or .0. Requires liberal number parsing that's OK with a decimal point at the start or end, assuming 0 for the missing integral or decimal part. 0000000. would give the same score. This also works in the following languages (in some cases with a different output, as indicated): Python REPL Javascript REPL ...


14

Japt & Japt, Score: 255 / 38 = 6.71 Program A: "iQ ²¯24 G²õ@i'#+Xd"iQ ²¯24 G²õ@i'#+Xd Program B is over 8kB long, so long that the link breaks, so I won't paste the whole thing. Here's a sample: #þ"iQ ²¯24 G²õ@i'#+Xd"iQ ²,#ÿ"iQ ²¯24 G²õ@i'#+Xd"iQ ²,#Ā"iQ ²¯24 G²õ@i'#+Xd"iQ ² I couldn't find a way to get a NUL byte to work, which is why program B only has ...


14

JavaScript, 9007199254741154 bytes n=0 a=Number.MAX_SAFE_INTEGER-1 b="Hlo, world![...]e" console.log(`${b[n]}${b[a]}${b[++n]}${b[n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}${b[++n]}`) Where [...] is \$2^{52}-14\$ ? characters. The -1 is needed since strings cannot be longer than \$2^{52}-1\$ characters. a cannot be ...


Only top voted, non community-wiki answers of a minimum length are eligible