Edit - Code Golf Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

Required fields*

Left Hand vs. Right Hand — Typists Challenge

Your task is to pit each side of the keyboard against each other and build two programs, in the same language, one using only keys on the left-hand side of a standard keyboard that outputs Pollinium milk; plump pumpkin; lollipop?, and one using the keys on the right that outputs Weatherheaded sweetheart haberdasheress!.

Rules

The exact keys allowed for the left-hand program are:

123456!@#$%^QWERTYqwertyasdfghASDFGH`zxcvb~ZXCVB

and for the right-hand program:

7890-=&*()_+uiop[]UIOP{}jkl;'\JKL:"|nm,./NM<>?

There are four free keys Esc (\x1b), Tab (\x09), Space (\x20) and Enter(\x0a and/or \x0d) which can be used in either, neither, or both solutions.

Your score will be the total byte count for both programs. Whilst I've used the term program, your submissions can either be full programs, or functions as usual, and both can be different types (eg. one full program, and one function).

Your result must include the desired text, any amount of leading and trailing whitespace is fine, as long as the exact text appears within it.

Standard loopholes are forbidden.

The shortest solutions in each language win.

Answer*

#[Whitespace](https://web.archive.org/web/20150618184706/http://compsoc.dur.ac.uk/whitespace/tutorial.php), <s>1175</s> <s>1143</s> <s>655</s> <s>645</s> <s>638</s> <s>632</s> <s>639</s> 578 (293 + 285) bytes

It had to be done.. ;p 
<s>Can definitely be golfed by filling the stack reversed and printing it all at the end in some kind of loop, but this is only my second Whitespace program ever, so I've yet to figure it out..</s> EDIT: Golfed.

+7 bytes because I misspelled `pumpkin` as `pumkin`.. (Thanks for noticing, *@fəˈnɛtɪk*.)

Letters `S` (space), `T` (tab) and `N` (new-line) added as highlighting only. 
`[..._some_action]` added as explanation only.

Left-sided `Pollinium milk; plump pumpkin; lollipop?`:

 [S S T	T	S T	T	T	T	N
 _Push_-47_?][S S S T	S N
 _Push_2_p][S S S T	N
 _Push_1_o][S T	S S T	N
 _Copy_1st_p][S S T	T	S T	N
 _Push_-5_i][S S T	T	S N
 _Push_-2_l][S N
 S _Duplicate_-2_l][S S S T	N
 _Push_1_o][S T	S S T	N
 _Copy_1st_l][S S T	T	S S T	T	T	S N
 _Push_-78_space][S S T	T	T	S S T	T	N
 _Push_-51_;][S S S N
 _Push_0_n][S S T	T	S T	N
 _Push_-5_i][S S T	T	T	N
 _Push_-3_k][S S S T	S N
 _Push_2_p][S S T	T	N
 _Push_-1_m][S S S T	T	T	N
 _Push_7_u][S S S T	S N
 _Push_2_p][S S T	T	S S T	T	T	S N
 _Push_-78_space][S S S T	S N
 _Push_2_p][S S T	T	N
 _Push_-1_m][S S S T	T	T	N
 _Push_7_u][S S T	T	S N
 _Push_-2_l][S S S T	S N
 _Push_2_p][S S T	T	S S T	T	T	S N
 _Push_-78_space][S S T	T	T	S S T	T	N
 _Push_-51_;][S S T	T	T	N
 _Push_-3_k][S S T	T	S N
 _Push_-2_l][S S T	T	S T	N
 _Push_-5_i][S S T	T	N
 _Push_-1_m][S S T	T	S S T	T	T	S N
 _Push_-78_space][S S T	T	N
 _Push_-1_m][S S S T	T	T	N
 _Push_7_u][S S T	T	S T	N
 _Push_-5_i][S S S N
 _Push_0_n][S S T	T	S T	N
 _Push_-5_i][S S T	T	S N
 _Push_-2_l][S N
 S _Duplicate_-2_l][S S S T	N
 _Push_1_o][S S T	T	T	T	T	S N
 _Push_-30_P][N
 S S N
 _Create_Label_LOOP][S S S T	T	S T	T	T	S N
 _Push_110][T	S S S _Add][T	N
 S S _Print_as_char][N
 S N
 N
 _Jump_to_Label_LOOP]

[Try it online](https://tio.run/##bU9BCoAwDDs3r8jXRAZ6ExR8fu3aMVcnjLYkabLe236V81jWokqK2BMBbaRX2FCrU9HgTKbqGhGNYTDuvI5tTEjfniUZ/4kZZT3uK05@0@eGg/x6A8CIlfCQxpoQqg8) (with raw spaces, tabs and new-lines only).

Right-sided `Weatherheaded sweetheart haberdasheress!`:

 [S S T	T	S S S T	S S N
 _Push_-68_!][S S S T	T	T	S N
 _Push_14_s][S N
 S _Duplicate_14_s][S S S N
 _Push_0_e][S S S T	T	S T	N
 _Push_13_r][S S S N
 _Push_0_e][S S S T	T	N
 _Push_3_h][S S S T	T	T	S N
 _Push_14_s][S S T	T	S S N
 _Push_-4_a][S S T	T	N
 _Push_-1_d][S S S T	T	S T	N
 _Push_13_r][S S S N
 _Push_0_e][S S T	T	T	N
 _Push_-3_b][S S T	T	S S N
 _Push_-4_a][S S S T	T	N
 _Push_3_h][S S T	T	S S S T	S T	N
 _Push_-69_space][S S S T	T	T	T	N
 _Push_15_t][S S S T	T	S T	N
 _Push_13_r][S S T	T	S S N
 _Push_-4_a][S S S N
 _Push_0_e][S S S T	T	N
 _Push_3_h][S S S T	T	T	T	N
 _Push_15_t][S S S N
 _Push_0_e][S N
 S _Duplicate_0_e][S S S T	S S T	S N
 _Push_18_w][S S S T	T	T	S N
 _Push_14_s][S S T	T	S S S T	S T	N
 _Push_-69_space][S S T	T	N
 _Push_-1_d][S S S N
 _Push_0_e][S S T	T	N
 _Push_-1_d][S S T	T	S S N
 _Push_-4_a][S S S N
 _Push_0_e][S S S T	T	N
 _Push_3_h][S S S T	T	S T	N
 _Push_13_r][S S S N
 _Push_0_e][S S S T	T	N
 _Push_3_h][S S S T	T	T	T	N
 _Push_15_t][S S T	T	S S N
 _Push_-4_a][S S S N
 _Push_0_e][S S T	T	T	T	S N
 _Push_-14_W][N
 S S N
 _Create_Label_LOOP][S S S T	T	S S T	S T	N
 _Push_101][T	S S S _Add][T	N
 S S _Print_as_char][N
 S N
 N
 _Jump_to_Label_LOOP]

[Try it online](https://tio.run/##dY9RCsAgDEO/k1P0amMI299ggx2/06DVyQaibUle6r3tVzqPZU3uZoDly4zlyQ1V1dbAqLtAHvZZqKAJMFgqvrlHR9O98BWlHVDOFGvNG5E/pI/VJymEZfxVaEVoRro/) (with raw spaces, tabs and new-lines only).

----------

**Explanation:**

It first build the stack reversed. Pushing a number is done as follows:

- `S` at the start: Enable Stack Manipulation
- `S`: Push what follows as number to the stack
- `S`/`T`: Sign bit where `S` is positive and `T` is negative
- Some `T` and `S` followed by an `N`: Put number as binary to the stack (`T=1` and `S=0`).

----------

Then it will loop over the stack reversed and print everything as characters. It does this as follows:

1. Push 0 (`SSSN`)
2. Push all numbers indicating the characters reversed as explained above
3. Create a `Label_0` (`NSSN`)
 1. Duplicate the top of the stack (`SNS`)
 2. If this value is 0: Jump to `Label_1` (`NTSTN`)
 3. Else: Pop and print the top of the stack as character (`TNSS`)
 4. Jump to `Label_0` (`NSNN`)
4. Create `Label_1` (`NSSTN`)

This above is the default layout for both programs. Here is the change-log for this default layout which lowered the byte-count even further:

1. All numbers are lowered by the same amount (<s>`100`</s> `110` in the first program, and <s>`102`</s> `101` in the second) to decrease the binary digits used for the now lower numbers, and between step 3.2 and 3.3 the following two sub-steps are added:

- Push 110 (`SSSTTSTTTSN`) in program 1, or 101 (`SSSTTSSTSTN`) in program 2
- Pop and add the top two values of the stack with each other, and the result is the new top of the stack (`TSSS`)

2. I've also used `SNS` in some cases to duplicate the top of the stack, which is used to golf the `ll`, `ll`, `ee` and `ss`.

3. In addition, step 4 (create `Label_1`) was removed completely. It will exit with an error, but will still output everything correctly ([which is allowed according to the meta](https://codegolf.meta.stackexchange.com/a/4781/52210)).

4. It's possible to copy an `n`'th value from the top of the stack (with `STS` + 0-indexed `n`), which is shorter than creating a new number in some cases. 
In the first program I've done this for: the second `p` in `pop` (`STSSTN` (copy 1st) is shorter than `SSSTTSSN` (create number for 'p')), the second `l` in `lol` (`STSSTN` (copy 1st) is shorter than `SSSTSSSN` (create number for 'l')), the second `p` in `p p` (`STSSTN` (copy 1st) is shorter than `SSSTTSSN` (create number for 'p')), the second `p` in `pumlp` (`STSSTTN` (copy 3rd) is shorter than `SSSTTSSN` (create number for 'p')), the second `p` in `pmup` (`STSSTSN` (copy 2nd) is shorter than `SSSTTSSN` (create number for 'p')), the second `m` in `m m` (`STSSTN` (copy 1st) is shorter than `SSSTSSTN` (create number for 'm')), the second `i` in `ini` (`STSSTN` (copy 1st) is shorter than `SSSTSTN` (create number for 'i')). 
In the second program this isn't done for any. The distance between some is pretty short, like `ere` or `ded`, but creating the number for 'e' (`SSTTN`) or 'd' (`SSTTSN`) are both shorter or of equal length as copy 1st (`STSSTN`), so I couldn't apply this trick in the second program to save bytes. ***NOTE: After golf-step 7, not all of these apply anymore.***

5. In both programs I've changed step 1 of the loop from `SSSN` (Push 0) to `SSN` (Push error_value), and removed the steps 3.1 (`SNS` Duplicate) and 3.2 (`NTSTN` If 0: Exit). Now it will simply exit with an error that `SSN` is an unknown value as soon as it's tries to access it.

6. Removed the `SSN`(error_value) completely in both programs. It will now stop with the error "*Can't do Infix Plus*" when it tries to do the Add-function with nothing left on the stack.

7. Changed the constant values of `100` and `102` to `110` and `101` respectively. [Here the Java program](https://tio.run/##bVLdatswFL7PUxx0JaHUpNAyFkeEBnphaEap1zLIypBTJVUjy5p1XAgjz@7KcR277W5sfL5fHflFvsqzl6ddXa@N9B6WUtt/IwBXZUavwaPE8Hot9BPkAaIpltpuV48gWUMDaAdQKl8ZBAFyNXmMj4i2CD6XxijfAIlFtVVltLz69efh6ub@egyJ@HYZD106@l3nRkiLb4qSNn5aJLGenV9OYs35e4O@gyBkjGMnOlWry/aoIJu2DaOtwkUYeMpOcgAUJE0Jp9mZnk3m5CeZkpSw@IR38etpdwosFtrKct9G0wZlS4nPkcx8Y8PY/5NCFhfr2cX3eUiYhqQ@5DAaUMiP33aAlYJipP5W0njqWNAGOOiR8bInOYHdR@elN7SMjLJbfKYMZqcFDxp92fnAcXB9vU0PJ2GuP0a2z3TvUeVRUWHkwn7QWEpauSC8M@UkDvdJeMJJOOu77Wcl/VjvyDqMDnVd3xbGaKurHHJtdjE4U@Uu/Le522kbg2lgV7j5Gw) used to generate the `110` constant; and [here the Java program](https://tio.run/##bVFbS8MwFH7frzjmKSGzTFDEdUEUfCg4H6w3UJF0PW7RrqvJmTJkv72mq13r5aUl57vm5EW/692X9LUsJ5l2Dsba5J89gGKZZGYCjjT53/vCpDD3EI/Jmnx6/whaVDSAegAW3TIjUKDvB4/hBjE5gZvrLENXAVFOOEUbjE/unm5Ozq/P@hCpw4Ow69LQLxs3xmr8eWF55WdUFJrR3sEgNFJ@N2g7KMb61C9Uo6p1yYoQkmHdMJginfqB42IrByDF4phJnuya0eCYXbEhi5kIt3gTPxk2t6DFqcm1XdXRvELFWNMs0ImrbIT4P8lnSTUZ7R8d@4ShT2pD1r0OhV085B3MKk4Bvi115nghvNbDXk9C2pZUKGoOjZd55jbIMJ/SjAsYbRfcafRn5x3HzvO1Ni0c@bn5GVl/45UjnAeLJQWF3w9lOWe1XDHZmEoW@vdkMpLM3/Xb9reS/6y3Ya1767Isb9GvG@0MdYopuA9Ef9SWYKYTtKl2HkTndr4A) used to generate the `101` constant. Note that there are now less _Copy_ used than described at point 4 above, because the new values are in many cases shorter than the copies, so re-pushing them is shorter.

If this is an answer to a challenge…

…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one. Explanations of your answer make it more interesting to read and are very much encouraged.
…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.

More generally…

…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).

Draft saved

Draft discarded

Edit Summary*

Cancel

\$\begingroup\$ The ST stuff is just push the number as binary, with space as 0, tab as 1. Output is the TNSS, so you have an extra two spaces at the beginning of each program. It also probably save bytes to duplicate and then add/subtract for each character and loop over the values at the end. \$\endgroup\$

Jo King
– Jo King

2018年03月09日 11:24:52 +00:00
Commented Mar 9, 2018 at 11:24
2

\$\begingroup\$ You misspelt pumpkin. \$\endgroup\$

fəˈnɛtɪk
– fəˈnɛtɪk

2018年06月05日 11:46:23 +00:00
Commented Jun 5, 2018 at 11:46
\$\begingroup\$ @fəˈnɛtɪk Whoops lol.. Should be fixed now, thanks for noticing. \$\endgroup\$

Kevin Cruijssen
– Kevin Cruijssen

2018年06月05日 11:58:40 +00:00
Commented Jun 5, 2018 at 11:58

Add a comment |

How to Edit

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

How to Format

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>
MathJax equations \$\sin^2 \theta\$

formatting help »
answering help »

MathJax help »

How to Tag

A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.

complete the sentence: my question is about...
use tags that describe things or concepts that are essential, not incidental to your question
favor using existing popular tags
read the descriptions that appear below the tag

If your question is primarily about a topic for which you can't find a tag:

combine multiple words into single-words with hyphens (e.g. code-golf), up to a maximum of 35 characters
creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you

popular tags »