Build a pipeline (raw)
Statement
You have to turn it into uppercase, take out the spaces, and reverse it. Three steps.
As in the previous problem, the model only produces the pipeline and the grader runs it.
Input Hello World The pipeline the model gives upper | nospace | reverse What the grader gets DLROWOLLEH
These three transforms give the same result in any order. So upper | nospace | reverse and reverse | upper | nospace both pass. The grader looks only at the result of running it, not at the shape of the program. There is more than one right answer.
The hard part is not the order. It is getting 0.6B to write all three steps without dropping one. Two steps go fine and the third one wobbles.
These are the only commands you can use.
upper uppercase · lower lowercase · reverse reverse · trim strip leading and trailing whitespace nospace take out every space · digits digits only · letters letters only first first character · last last character · len character count · sort sort the characters
Join them with |. They are applied left to right. Up to 6 steps.
Input
The input arrives as one line.
The input is between 11 and 13 characters long.
Output
On the first line, print the three step pipeline.
After the grader applies your pipeline to the input, the result is 10 to 12 characters long.
Do not add any other characters.
Not a single character may differ from the expected value.
Requirements
- The input is a string of two words.
- The output is a three step pipeline.
- This is raw mode. Your two pieces and the input are joined together as they are and fed to the model. No chat template and no
<think>is added. Grading looks only as far as the first line. - What the model has to produce is not the result but a command pipeline. The grader applies those commands to the input.
- The output must match the expected value down to the last character. Only leading and trailing whitespace is ignored.
- There are 16 cases, and 5 of them show the input together with the expected output. The rest show the input only.
- Model output is accepted up to 16 tokens.
- You have to pass all 16 cases to solve this.
Examples
5 public cases. Judging also uses hidden cases. You have to pass all 16 cases to solve this.
Hello World
DLROWOLLEH
Local Judge
EGDUJLACOL
Margin Probe
EBORPNIGRAM
Token Stream
MAERTSNEKOT
Greedy Decode
EDOCEDYDEERG
Prompt
Qwen3 0.6BHello World