[ENDED] Code Golf Contest #9

[alberthrocks]

Well that's the challenge, print a specific number with a language that supports numbers but without using any
It's like running a game, it's not impressive on a game console but it is more of a challenge on a printer.

But wouldn't it be a real challenge if there were no numbers or letters in the language at all?

[Hayleia]

It would and it wouldn't.
With such languages, writing anything is a challenge, but writing something specific is not more of a challenge than writing something else

[JWinslow23]

Deadline reset.

[JWinslow23]

Bump.

I just have to tell this to someone.

The top entry in Contest #9 is 4 bytes
The next 4 entries are 9 bytes (that's not all...)
The next entry is 18 bytes (and 1+8=9)
The next 2 entries are 22 bytes (2 2s together)
The ninth entry is 32 bytes (and 3^2=9)
Looking at the next 4 entries, the first 2 and last 2:
      a). are done in different variants of the same lang
      b). have size differences of 1 byte
      c). the more advanced version of the lang has the smaller size

Coincidence? I think not!

[Princetonlion.tibd]

Are you suggesting we are doing this on purpose

my 68k, if it qualifies, is an exception. more advanced but huge due to me not knowing how to optimize well with 68k.

EDIT: I don't qualify. forgot

[JWinslow23]

Wait...take the sum of all of the entry sizes in the Language Ranking list (330, if you don't wanna do the math )...

...the sum of the digits is 9 (but it doesn't stop there)...

...also, divide the sum by the largest value (63)...

...you get 5.23809523809523809... (repeating)...

...the section that repeats is 5,2,3,8,0,9...

...add them together, you get 27...

...add up the digits of 27, you get 9...

...which is also the number of the contest!

Coincidence?

[Juju]

I broke the 9 wall >.>

[JWinslow23]

4 hours left! Make your last 9 solutions and early 10 solutions!

[alberthrocks]

4 hours left! Make your last 9 solutions and early 10 solutions!

Final entry submitted at 12:59 AM 9/15/14!

EDIT: 1 AM exact!

[JWinslow23]

Congratulations, alberthrocks! I am accepting your submissions.

[Adriweb]

BTW, optimization for (Nspire)-Lua based on LDStudio's code  ( 2 bytes less, 32 total )

Code: [Select]

s=string.byte print(s"\r"..s"%")

[lirtosiast]

I would like to point out that calc84's submission in TI-BASIC is 10 bytes, not 9, because e is a two-byte token.

Edit: int(π²^π+cosh(e is 9 bytes.

Edit: ^-int(^-₁₀^(πtanh(int(π is 8 bytes. A solution in 7 may be possible.

[pimathbrainiac]

Since these Code Golf topics are no longer running, will you please refrain from posting in these topics? What you are doing is called necroposting, and it is generally frowned upon unless it has something valuable to add to the conversation or is a thread re-pick-up or update. Thanks.

[lirtosiast]

Sorry! I was under the impression that the code golf contest threads were open to discussion about the optimal solution to the problems, even after the end of the contest. I know the contests have been closed for months, but I thought I was contributing something valuable.

[pimathbrainiac]

It's okay. The way you phrased your reply was a little off-putting, though. A hint: if you see the red text about the topic being over 120 days since the last post (or however long that is), it probably isn't a good idea to post.