As of 27/12/20, the challenge is over as no new answers were posted on the 26th. With an astounding 55 points (and 21 answers), the winner is pppery!
A quick shout out to the top 5 scorers as well:
- 1st. pppery with 55 points across 21 answers
- 2nd. tsh with 50 points across 21 answers
- 3rd. SunnyMoon with 21 points across 6 answers
- 4th. NieDzejkob with 17 points across 4 answers
- 5th. pxeger with 16 points across 7 answers
A full table of everyone's daily scores can be found below. Empty cells indicate no answer
This challenge will function somewhat like an answer-chaining question, in that new answers will (somewhat) depend on old answers. However, this is (as far as I can tell) a unique form of answer-chaining, so be sure to read the entire challenge if you'd like to take part.
Normally, answer-chaining challenges work in increments of answers. Each new answer is related to the previous answer, and so on. However, in this challenge, we will change the increments from single answers to single days.
Here's a step-by-step breakdown of how the challenge will work:
- The challenge will be posted at exactly 00:00UTC
- From then until 23:59UTC, users may post answers that complete the task (specified below) while also following some of the restrictions (also specified below). Each answer will include:
- A language available to be used
- A program in that language which completes the task
- A single restriction on the source code of new answers
- At 00:00UTC, the restrictions will update from those listed in the body of the challenge, to those listed by answers posted the previous day.
- Repeat the previous 2 steps until the challenge ends.
Task
All answers, regardless of when they were posted, must output the number of days the challenge has been going at the time of posting. So the first set of answers will output 1, those posted on the second day 2, third day 3 etc.
Restrictions
For the answers posted on the first day, the first set of restrictions are:
- You must include the
0x10
byte in your source code - You must have an even number of bytes in your source code
- You must only use even bytes in your source code
When you choose your restriction, you may only impose a restriction on the source code. This can be as weird as you like (e.g. it must be shaped like unfolded Hexagony code), or a basic as "cannot use this byte", but you may only restrict the source code, rather than e.g. language used. As a general rule, if a challenge including this restriction would be tagged restricted-source or source-layout, it's good to go.
Scoring
New answers do not have to follow all of the restrictions. Instead, they must choose between 1 and all the restrictions to follow. Each answer is worth a number of points equal to the number of restrictions it follows. Your score is the total for all of your answers. Highest score at the end of the challenge wins.
Ending criteria
The challenge ends when an entire day passes with no new answers, as the restrictions will be updated to nothing.
Formatting
Please format your answer in the following way:
# Day <N>. <Language>, score <X>
<code>
This follows the restriction(s):
- <restriction 1>
etc.
- <restriction X>
Answers posted tomorrow may use the restriction that <restriction>
---
<Anything else you want to include>
Rules
- You may only post 1 answer per day
- You may only specify 1 restriction in your answer. This restriction may be impossible (as people do not have to use it), and may be the same as another answer posted that day. It may also be the same as a restriction from a previous day, but I encourage you to choose more original restrictions over reusing ones.
- Your score only counts unique restrictions used. If the same restriction is specified by 3 previous day answers, you may only count it as 1.
- You may use any language that hasn't been used on a previous day. You may use a language that has already been used this day, so multiple answers on a specific day can use the same language.
- Byte count has no bearing here, so you are under no obligation to golf your code.
- If restrictions involve specific bytes to be avoided, included etc., you may use any pre-existing code page of your choice, so long as it is supported by your language
- You may submit either a full program or a function, so long as it operates under our standard output formats
- Be sure to pay attention to when you are posting your answer. If it is posted at 00:00UTC, it is the first answer for the next day, not the last answer for the previous day.
- Times will be measured using SE's time and dating for posts, which can be seen by hovering your mouse over posts which still have "posted X hours ago" or "posted yesterday"
- Different versions of languages, e.g. Python 2 and Python 3 are different languages. As a general rule, if the different versions are both available on Try It Online, they are different languages, but keep in mind that this is a general rule and not a rigid answer.
- Regardless of whether they're both on TIO, minor versions of a language (e.g. Python 3.4 and Python 3.8) are not different languages.
Good luck!
Daily scores
Day | Redwolf Programs | Lyxal | Bubbler | Jonathan Allan | Razetime | tsh | NieDzejkob | Noodle9 | SunnyMoon | pppery | user | PkmnQ | Ramillies | pxeger |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Points | 9 | 3 | 3 | 3 | 3 | 50 | 17 | 2 | 21 | 55 | 6 | 11 | 6 | 16 |
Answers | 2 | 1 | 1 | 1 | 1 | 21 | 4 | 1 | 6 | 21 | 1 | 2 | 1 | 7 |
1 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 2 | 3 | 3 | ||||
2 | 6 | 6 | 5 | 7 | 7 | 6 | 5 | 6 | ||||||
3 | 5 | 6 | 6 | 6 | ||||||||||
4 | 2 | 4 | 2 | 4 | ||||||||||
5 | 1 | 2 | ||||||||||||
6 | 2 | |||||||||||||
7 | 1 | 1 | ||||||||||||
8 | 2 | 2 | ||||||||||||
9 | 2 | 2 | ||||||||||||
10 | 2 | 1 | ||||||||||||
11 | 2 | 2 | ||||||||||||
12 | 2 | 2 | 2 | |||||||||||
13 | 3 | 3 | ||||||||||||
14 | 1 | 1 | 1 | |||||||||||
15 | 3 | 3 | 3 | |||||||||||
16 | 3 | 2 | 3 | |||||||||||
17 | 3 | 3 | 3 | |||||||||||
18 | 2 | 2 | ||||||||||||
19 | 2 | 2 | ||||||||||||
20 | 2 | 2 | ||||||||||||
21 | 2 | 2 | 2 | |||||||||||
22 | 3 | 3 | ||||||||||||
23 | 2 | 2 | ||||||||||||
24 | 2 |