Let's rise higher [closed]

Question

Challenge

The main objective of the challenge is pretty simple, this is an answer chaining contest, where you have to serially print numbers from 1. That means User 1's answer will print 1, then User 2's answer will print 2 and so on. But there are some rules to make the contest tougher.

Rules

• You can't use the characters of the source code used in the previous answer.

• Use of comments in your code is disallowed.

• You cannot post 2 answers in a row, let me explain, suppose you have written answer no. 5, now you cannot write answer no. 6, you have to wait someone to post a valid answer no. 6 (That prints 6 without using characters in answer no. 5), and after that you can write a valid answer no. 7 following the rules.

• Program cannot take input or access internet.

• Standard loopholes apply.

• You can have leading/trailing newlines but not whitespaces (except newline) in the output.

Scoring criterion

This is not code-golf challenge, so there is a custom objective scoring criteria. Try to make your score higher.

• Each answer's initial score is 1. (Only chain beginning answer has score 0).

• For each distinct byte you use, your score is increased by the number of distinct bytes. That means if your number of distinct bytes is 6, then your score increases by 1+2+3+4+5+6, and if your number of distinct bytes is 7, then your score increases by 1+2+3+4+5+6+7 and so on.

• You have to calculate distinct byte difference with the previous answer, and add/subtract score using the 2nd rule. So if byte difference is 3 then you will get a +1+2+3 score, or if -3 (Previous answer has 3 more distinct bytes than yours), then -1-2-3.

• For each 1 to 9th byte -1, from 10th to 19th byte -2 for each byte, from 20th to 29th byte -3 for each byte and so on.

A total example:

Answer format

# Answer Number. Language Name, x Bytes, y Distinct bytes, Score: Z

    source code

(TIO/Any other interpreter link) -> Not required, but preferred

example

1. Powershell, x Bytes, y Distinct Bytes, Score: Z

......

Winning criterion

Winner will be determined after 30 days, winner is determined by total score. But users are welcome to continue the chain after that!

Suppose you have three answers with score 33,16,78 then your total score will be 33+16+78=127.

And there is two special prizes from me after 30 days:

• +150 bounty for the winner.
• +50 bounty for the single answer with highest score! (Such as man of the match in Cricket)

Answer 1

2. Python 3, 102 bytes, 66 distinct bytes, Score: 3710, My Total Score: 3710

print(int(str(2+3+4+5+6+7+8+90-25*5+2)+"abcdefghijklmnopqrstuvwxyz`-=:{}][;'_+()*&^%$#@!~`/.,?>< "*0))

Try it online!

Answer 2

3. Vyxal, 162 bytes, 162 distinct bytes, Score: 16467, My total score: 16467

γ₥⌊₴λƛ¬∧⟑∨⟇÷«»°•․⍎Ṛ½∆øÏÔÇæʀʁɾɽÞƈ∞⫙ß⎝⎠⎡⎣⨥⨪∺❝ð→←ÐřŠč√⳹ẊȦȮḊĖẸṙ∑Ĥ⟨⟩ı⁌\tΤĴ²‿⁂ĸ¶⁋⁑Ńń‼⨊≈µʗ◁⊐∫⍋⍒∈ₛ£Œœ≕≠¥ⁱ‹›⍲⍱‸¡⊑≀℅≤≥↜≗⋯⧢ũ⁰¹ªₑϊ≎⇿⊛ׯ±⊂⍞፣⍉ΐ₁⊘ᶢ₌↭ſƀƁ⁚⌈⊓⊣Ḟḟ∪∩⊍⁜⌑Ḇ₂⁾₦¼ƒɖꝒ′α″βΠ"

Try it Online! The power of Unicode. I'm not sure about the score, but this takes the average of [1, 2, 8] (3.66666...) and takes the floor of that number.

Feel free to correct my score if needed. I calculated it as \$(1+2+3+...+162)\$ [part 1 of scoring]

\$+ (1+2+3+...+96)\$ [part 2 of scoring: 162 my answer - 66 previous answer = 96 difference distinct bytes)

• (sum(map(lambda x: x*10, range(1, 17))))\$ - 16*2\$ [part 3]

My scoring utility. Takes number of distinct bytes in your answer, the number of distinct bytes in the previous answer and the length of your answer

Try this one instead. It should work a bit more accurately and work for higher byte counts. Inputs are: a) your distinct bytes, b) last answers distinct bytes, c) program length

Answer 3

1. PowerShell, 1 byte, 1 distinct byte, Score: 0, My Total score: 0

1

Try it online!

Answer 4

6. Mornington Crescent, 425 423 396 bytes, 30 32 distinct bytes, score -8475 -8391 -7155

To break the monotony of using all of the ASCII characters, let's rule out only some ASCII characters for the next answer. This is the shortest program in this language that outputs 6. I'm pretty sure making it any longer to include more distinct bytes would make the score even lower, as adding any more extraneous instructions would necessarily reuse some bytes.

Take Northern Line to Euston
Take Victoria Line to Seven Sisters
Take Victoria Line to Victoria
Take Circle Line to Victoria
Take District Line to Upminster
Take District Line to Parsons Green
Take District Line to Notting Hill Gate
Take Circle Line to Notting Hill Gate
Take District Line to Upminster
Take District Line to Bank
Take Circle Line to Bank
Take Northern Line to Mornington Crescent

Try it online!

Distinct bytes used: BCDEGHLMNPSTUVaceghiklmnoprstuv

Answer 5

4. C (gcc), 106 bytes, 91 distinct bytes, Score: 6132, My Total score: 6132

main(){printf("%d",strlen(" !#$&'*+./0123\4789:<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[]^_`bcghjkoquvwxyz~")-65);}

Try it online!

Answer 6

7. Keg, 4,376,598 bytes, 2,157,610 distinct bytes, Score: 3697321176253, My total score: 3697321192720

You can find the source code here

Don't even bother trying it online. This uses everything in unicode except the bytes \n BCDEGHLMNPSTUVaceghiklmnoprstuv, so the next person to answer is going to have an extremely low score.

Here's how I generated it:

file = open("seven.keg", mode="w", encoding="utf-8")
file.write(chr(127240))
file.write("¶")
bad = " BCDEGHLMNPSTUVaceghiklmnoprstuv"
bad += "\n¶" + chr(127240)
for i in range(4294967294):
    letter = chr(i)
    if letter in bad:
        continue
    try:
        file.write(letter)
    except:
        continue
file.close()

Which turns into:

🄈\";_`<massive string of unicode>`_

Which prints 7 and then pushes (" - 1), discards that, pushes a massive string and then discards it.

Don't bother putting the score into my utility. It's calculated via:

$$ \frac{2,157,610 \times 2,157,611}{2} + \frac{(2,157,577 \times 2,157,578}{2} - rule3 $$

• it uses the triangle number formula to speed up computing. 2,157,577 = 2,157,610 - 33. The total score is calculated by:

score = 4655211869108
for i in range(437696):
    score -= 10 * i
score -= 9 * 437695
print(score)
print(score + 16467)

Answer 7

[5. Vyxal, 12 bytes, 9 distinct bytes, score 3436]

⨥⨥²⨥⨥⨪½Ç◁ṙȦ₴

Try it online

Well I really just wanted to get this challenge moving again, after @Noodle9 basically ruled out the entire ASCII character set! So I learnt a little Vyxal just for this... after writing a Deadfish interpreter here Vyxal actually made some sense...

I'm sure I could do more useless operations to the register, but basically its just increment twice, square it, increment twice then decrement for 5, half it for 2.5, subtract from 1 for 1.5, reverse for 5.1, round it for 5, take the absolute value, and output it.

(As far as the scoring, I'm totally confused, I just put what Lyxal's utility gave me. From the text, it sounds like my small answer should have a negative score for being smaller than #4...)

Answer 8

Deadfish~, 8 bytes, 3 distinct bytes, Score:2,327,635,062,034 according to Lyxal's utility?

iisiiiio

Try it online!

Well with not many options left from Lyxal's answer for #7, I had to resort to Deadfish...