Starman Innovations logo

Starman
Innovations

Official Minkolang Online Interpreter - version 0.15

Examples:


||

||

step(s), ms

|| bytes, chars || Status: awaiting code

Note: Run is limited to 1 minute at a time and Slow is limited to a total of 1000 steps or 1 minute, whichever is shorter.

Current instruction:

Input:

Output:


		
		

Stack:

Loops:

Register: 0

Instructions:

Movement Control structures Literals/Generation Math and comparisons Input and output Stack manipulation Memory and reflection (self-modification) Special Grouped: Math Grouped: Trigonometry Grouped: Lists and Strings Grouped: Matrices

A note: matrices are stored in the following manner: a stack of [12,11,10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 4, 3] corresponds to

  1  2  3  4
  5  6  7  8
  9 10 11 12
That is, the elements of the matrix are stored in reverse reading order (i.e. right to left, bottom to top), the top element of the stack is the number of rows and the next topmost element element is the number of columns. Any elements needed after the stack is exhausted will be zero. All matrix operations assume the matrices have been properly stored.

Grouped: Binary Operations Grouped: Itertools and Miscellaneous

Note: for each itertool function (the first four), the input iterables are preceded by a number that denotes how many elements the iterable has. Each item in the output of each itertool function is preceded by a number that denotes its length, and the whole output by a number that denotes its length.