Determine the lexicographical permutation your code is in

Question

Write a program that outputs the number 0.

That's a bit trivial, isn't it?

Let's sort all distinct permutations of your code in lexicographical order. When any of these codes are run, it should output the its location in the array (0-indexed or 1-indexed).

This means that your code must be the lexicographically smallest permutation of your code possible.

For example, if your code is ABB, then ABB -> 0; BAB -> 1; BBA -> 2.

Rules

• Out of all distinct permutations of your code, it must be the lexicographically smallest.
• Your program must be at least 3 bytes long.
• "Output" represents any acceptable output: on the stack, to STDOUT, as a return value, as an exit code, etc.
• Your program is to not take any form of input.
• This is code-bowling, so longest code wins.

Answer 1

brainfuck, bytes = score

...

Try it online!

How it works: this program only has one distinct permutation and it outputs 0. It trivially satisfies all the other restrictions. The score can be made arbitrarily large by adding more ..

Answer 2

Python 2, score = arbitrary

000

Try it online!

Returns through exit code, which is always 0.
The source code is 0 repeated arbitrary many times. Since there's only 1 permutation of the source code, the permutation number is always 0.

Answer 3

!@#$%^&*()_+, 548+++ bytes

#^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Try it online!

This can also be just#^^. # prints and ^ increments. Please tell me if this is not lexicographic order, instead of downvoting.

Answer 4

dc, Arbitrarily large number of bytes.

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Try it online!

No matter how many 0s you write, it will leave a 0 on the stack, which is an acceptable output form for the challenge. (The p in the TIO footer prints the stack so you can see what it is.)

Of course, the only permutation is the program itself.

Answer 5

MathGolf, 3 bytes (3 distinct permutations)

Outputs via unary, with a different set of output: 2 -> 3 -> 4.

00\

Try it online!

Explanation

00\
00  Push 2 0's
  \ Swap (resuting in 2 0's)

0\0
0   Push 0
 \  Swap
  0 Push 0 (3 0's)

\00
\   Swap the empty stack (appends 2 0's)
 0  Push 0
  0 Push another 0 (resulting in 4 0's)