Sandbox for Proposed Challenges

Question

This "sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to main. This is useful because writing a clear and fully specified challenge on your first try can be difficult, and there is a much better chance of your challenge being well received if you post it in the sandbox first.

Sandbox FAQ

Posting

To post to the sandbox, scroll to the bottom of this page and click "Answer This Question". Click "OK" when it asks if you really want to add another answer.

Write your challenge just as you would when actually posting it, though you can optionally add a title at the top. You may also add some notes about specific things you would like to clarify before posting it. Other users will help you improve your challenge by rating and discussing it.

When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and delete the sandbox post.

Discussion

The purpose of the sandbox is to give and receive feedback on posts. If you want to, feel free to give feedback to any posts you see here. Important things to comment about can include:

• Parts of the challenge you found unclear
• Comments addressing specific points mentioned in the proposal
• Problems that could make the challenge uninteresting or unfit for the site

You don't need any qualifications to review sandbox posts. The target audience of most of these challenges is code golfers like you, so anything you find unclear will probably be unclear to others.

If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.

It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.

Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

To add an inline tag to a proposal, use shortcut link syntax with a prefix: [tag:king-of-the-hill]. To search for posts with a certain tag, include the name in quotes: "king-of-the-hill".

Answer 1

Write a proper quine.

Community decided that you're not allowed to claim you're not reading source code but data, and read a stored string.

To be consistent, reading a stored infinite precision number is also not allowed. (should this, or only apply to highbase?)

Answer 2

You're a programming language, right?

According to CGCC, for something to be considered a programming language, it must be capable of addition and primality testing. This challenge combines them into one.

Challenge

You must write a programme that takes 2 natural numbers (including 0) as input, checks if the sum of the numbers is prime, and prints the result. Input and output may be in any reasonable format.

Testcases:

2,3 -> True
3,6 -> False
0,1 -> False (1 is not prime by definition)
7,6 -> True
37,81 -> False
37,82 -> False
1,1 -> True
5,8 -> True

Note that True and False can be substituted with another reasonable representation, like 1 and 0, or T and F. Remember, this is code-golf, so standard code-golf rules apply.

code-golfmath

Answer 3

Your challenge is to write a small compiler/interpreter to a small language. This language can be of any level. Example: brainf*ck or Turing.

Example submission:

languageName : “name” 
GitHub : “https/GitHub.com/Lang”

a language is valid if it contains the folowing systems:

1: varibles of any type
2: a method of declaring and using functions
3: definable parameters
4: a update loop
5: loops
6: classes(optinal)

a compiler/interperater is valid if it can:

1: run/compile code
2: is fast (less than a minute to compile/initialize)
3: give error messages(optional)
4: written in java

The smallest compiler/interpreter wins

please tell me how i can fix this post if you intend on downvoting it in the comments

Answer 4

Find the square of a number without using the multiplication sign or division sign

e.g. "/" "//" "*" "**" are not allowed

no imports are allowed either

An integer will be given in the input

Test cases:

5 -> 25

6 -> 36

10 -> 10

724 -> 524176

Answer 5

Prime strings

Your task is to find the string consisting of all the words in the give input whose lengths are prime numbers

Test cases:

The quick brown fox jumps over the lazy dog.
->
The quick brown fox jumps the

Omicron Effect: Foreign Flights Won't Resume On Dec 15, Decision Later.
->
Omicron Effect: Foreign Flights Won't On Dec 15,

You may assume that only ascii characters are allowed and that uppercase, lower case, punctuation, and spaces are allowed in the input and output

You may assume that the words whose lengths are prime numbers do not include spaces

Answer 6

Outgolf me with the custom scoring

Cops:

You post two codes, a code is that you wanted to do, another is used to size the code.

Rules

• Outgolfing must be 1 bytes or fewer

• Code that sizes solves the decision-problem is Fine

• Standard loopholes apply

Example:

# [Python 3](https://docs.python.org/3/), score 21 

# Code

    print("""s""")

# Sizer

    print(len(input())/2)

Scoring (Cops)

\$s + \lfloor\frac{(m)}3\rfloor\$

Where \$s\$ is the size of actual code and \$m\$ is the size of code used for sizing the code.

The lowest Score of uncracked Cop wins

Robbers

Your task is to find code, If the code size is less than the Cop's code, Then Post an answer That cracks the Cop's answer.

Rules

• Standard loopholes apply

Example:

# [Python 3](https://docs.python.org/3/), [Cracks username Cop](https://codegolf.stackexchange.com/questions), 2 score saved

    print("s")

The Poster with most cracks wins

Meta

• Any feedback?

Answer 7

Draw a Test tube

code-golfascii-art

Given the level of liquid in the test tube L in the range 0-8. Your program should draw the following ASCII art.

When L=0:

@@@@@@@@
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
  @@@@

When L=1:

@@@@@@@@
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @++++@
 @++++@
  @@@@

When L=2:

@@@@@@@@
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @    @
 @++++@
 @++++@
 @++++@
 @++++@
  @@@@

And etc. You can change the characters @ and + to any others (except spaces), it's up to you. Trailing spaces are allowed.

This is a code-golf challenge so the shortest solution wins.

Answer 8

Generate a random string of length 8

The challenge is pretty simple. Generate a random (non-zero chance) string of length 8, using ASCII characters from 33-126 (! to ~). (1-32 and aren't included because they don't show up/may cause interference.)
Remember that this is code-golf, so shortest answer wins!

Rules

• All standard rules apply
• All characters must be in one continuous string, so no line breaks, spaces, etc.

Example code

import random
i=8
j=""
while i!=0:
    j+=(chr(random.randint(33,127)))
    i-=1
print(j)

Try it online!

Tags

code-golf random string

Answer 9

Longest code to output "Hello World"

Rules

1. The program should take no input, and only print Hello!, World? to STDOUT with exact same capitalization and punctuation and in single line. Trailing whitespaces and newlines are allowed.
2. The output should not be in the form of error message
3. The accepted answer will be the 'most points' answer but try to be as creative as possible

Point System

1. +1 for each character of code in your program, eg:print("Hello World") is 20
2. -1 for each repeated character(case sensitive, i.e. 'h' is not same as 'H'), eg:print("Hello World") is 20-1(o)-2(l) = 17

Answer 10

Calculate the day of the week from a given date without using built-in functions that do so. For example C#'s DateTime.DayOfWeek is not allowed. Anything along the lines of DateTime.Year.IsLeapYear or DateTime.Month.TotalDaysInThatMonth (pseudocode) is also disallowed. Anything other built-in functionality for getting the number of days in a month or year is disallowed. You have to build that functionality yourself.

Input: a 1 dimentional array of integers with length 3. The array has the the form {year, month, day}
Output: A string such as "Monday", "Tuesday", etc. Case insensitive.

This is code gold so the shortest answer wins!

Test Cases:

Input	Output
{1000, 3, 31}	"Monday"
{1969, 4, 20}	"Sunday"
{1980, 2, 29}	"Friday"
{1979, 2, 29}	empty string, or null or throws an error. (This date does not exist)

Answer 11

Is the UTF-1 string shorter than its UTF-8?

code-golf decision-problem

Backgrounds

• explain utf-1 and utf-8

Problem

Given a Unicode string, output a two distinct truthy or falsey value to represent whether its representation in UTF-1 is shorter than that in UTF-8.

I/O restriction

Input can be list of code point for each letter or string with consistent encoding except UTF-1. Output can be as in decision problem rule.

todo rules

todo test cases

• Falsey for any string with nothing other than c such that U+0000<=c<=U+007F

Answer 12

Output a googol code-golfnumberkolmogorov-complexity

Your challenge today is to output this exact number:

10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

We call this a googol. A googol is 1 followed by a 100 zeroes, or basically just \$10^{100} \$. However most programs wouldn't be able to do a simple print(10**100) because it will take forever to do so. And sometimes it might end up with an OverflowError, so you'll have to be creative.

Input:

None.

Output:

The googol. However, if your language will not be able to store \$ 10^{100} \$, you'll have to find some way of printing it, maybe by string manipulation (the shortest I got was print('1'+'0'*100))

This is code-golf, so shortest answer wins!

Answer 13

This is a problem I solved, but now I am curious whit what techniques it can be improved. The original language is Java but here it doesn't matter.

You start with a list of n strings with a length of 7 characters. What is the most efficient algorithm (fastest) to determene the longest substring all the elements have in common, excluding the first character.

example 1:
input: "S000001", "S000002", "S000003", "S000004"
expected output: "00000"

example 2:
input: "S020011", "S020012", "S020013", "S020014"
expected output: "02001"

example 3:
input: "S010001", "S000002", "S000003", "S000004"
expected output: "000"

example 3:
input: "S109001", "S22090", "S090003", "S090004"
expected output: "090"

When there are no common substrings the output is null, an empty string etc. but not a caracter [a-zA-Z]|[0-9]

The input is an array of strings, texts or equivalent in your preferred language (not a char[] or binary, etc).

Answer 14

ChatGPT Prompt Challenge

Since clever prompting will become an art comparable to the art of programming it might be time to start with some prompt challenges that come closest to programming. It's about forcing ChatGPT to give specific answers or to perform specific tasks by shortest-possible prompts. As a general requirement the prompts should be human-understandable and be answered by humans identically or similarily.

Samples

Find the shortest prompt that ChatGPT just repeats.

Since ChatGPT operates stochastically we never can be sure if in the 101th regeneration of a response it will respond differently, so a decent criterion for "just repeats" must be established here.

Find the minimal number of words to be changed in prompt X to let ChatGPT perform task Y.

Consider X = "Saying with fewer words is the task of producing a shorter version of a document while preserving its important information. Some models can extract text from the original input, while other models can generate entirely new text." The task that ChatGPT reliably performs on this prompt is confirming and elaborating on it. By inserting two words you can force ChatGPT to summarize this prompt (Y = summarization)

Answer 15

[semantic-code-golf new contest type proposal]

Given a phrase, express it, or something with the same meaning, in as few syllables as possible. Entries may be in any officially recognised or well-known language that is not a programming language (e.g. you can use Chinese or English, but not MyOwnSpokenLanguage or Python). Shortest number of syllables wins!

Answer 16

Obfuscated bananas

---

In this challenge, your task is to print the string banana, case insensitive, to STDOUT (or an acceptable alternative) in the most obfuscated way.

+1 VTC! No objective winning criterion!

Wrong! I now have an objective winning criterion!

---

Let the reporter edit distance of \$a\$ and \$b\$ be the lowest number of operations on \$a\$ required to have a consecutive subset of \$a\$ equal to \$b\$. For the reporter distance, you can only use these operations:

• Add a character
• Remove a character
• Change a character
• Swap the positions of two characters

---

Your score is the reporter distance of your source code and banana, case insensitive, with a higher score being better.

---

code-challengeunderhanded

---

Meta

• Duplicate?
• Unclear?
• More tags?
• Anything else?

Answer 17

Make a search engine!

code-golf

Background

You are now the first employee of DuckDuckGoogle, a company founded by a Google employee and a DuckDuckGo employee! They have a new vision for search engine! But obviously, they need to make a search engine first! However, they are bad programmers (nobody knows how they were even hired at DuckDuckGo and Google!). So you are assigned the task of making a search engine.

Search engines

There are three parts to a search engine, a web crawler, an indexer, and a searcher.

The web crawler takes a link, and saves the page and stores the page data (the HTML code). It then looks for links in the page and visits those webpages and does the same. It will continue to do this until there are no more links left.

The web indexer will take the text from each page, take each word, and add it to a dictionary of words and the pages it is associated with. If the word is already in the dictionary, it adds the page as a value of that word that is found in the page. For example, lets say www.example.com/index.html contains the text "hello. thanks! goodbye." and the ww.example.com/index.html is linked to www.example.com/hello.html with the. text "hello. goodbye." The crawler would extract the text from the index.html, and find hello.html, and extract the text from hello.html. The indexer would make a dictionary like this:

dictionary ={"hello.": ["www.example.com/index.html","ww.example.com/hello.html"], "goodbye.":["www.example.com/index.html","ww.example.com/hello.html"], "thanks!": ["ww.example.com/index.html"]}

The simplest part of the search engine is the searcher, or retriever. It simply retrieves the value for the search term (i.e. the list of pages the search term is found in) and prints it. That is the final result of the program. So if the search term is "hello.", the program will print ["www.example.com/index.html","ww.example.com/hello.html"]

Now, here is the difficult part. You must take into account punctuation. So "hello" returns the same as "hello." Also the search engine should be case-insensitive. So "Hello" is the same as "hello", which, as we said, is the same as "hello." which was ["www.example.com/index.html","ww.example.com/hello.html"]

Challenge

The challenge is to write a search engine in the least number of bytes as possible. Why? Because your bosses have decided to use 90% of the one hard drive they have (budget problems!) for the Holy Grail part of their project and you only get 10%.

Rules

1. The input is the "seed", a url at which the crawler should start at, and also the search term.
2. The output is a list of webpage urls where the search term is found.
3. The program cannot use builtins for a search engine or even a crawler (or related, like a scraper or spider library).
4. No need to worry about Javascript at all. Assume that the pages will not have Javascript.
5. The webpages are assumed to have HTML 4.0.1 Strict.

Testing

I am pretty sure people know how search engines work. So I will only include two testcases. You can use the websites in the testcases for testing purposes as well.

> "https://www.udacity.com/cs101x/index.html" "crawl"
["https://www.udacity.com/cs101x/index.html","https://www.udacity.com/cs101x/crawling.html"]

> "https://www.udacity.com/cs101x/urank/index.html" "hummus"
["https://www.udacity.com/cs101x/urank/index.html","https://www.udacity.com/cs101x/urank/hummus.html","https://www.udacity.com/cs101x/urank/arsenic.html","https://www.udacity.com/cs101x/urank/kathleen.html","https://www.udacity.com/cs101x/urank/nickel.html","https://www.udacity.com/cs101x/urank/zinc.html"]

Answer 18

Calculate Hello World!

popularity-contest hello-world underhanded

Your goal is to calculate the simple string "hello world" or any other variant.

Rules

• You may not use the characters in this set (inside your code): hHeElLoOwW rRdD!, in any form (character codes, hex codes, etc. not allowed) [only applies for direct use].
• Your program may not take any input from any source.
• Your program may only print hello world or any other variant to standard output (for your language). Again, it may not print anything else.
• Standard loopholes apply (to clarify, they are not forbidden).
• This challenge is underhanded.
• Your program may not use any built-in string of printable characters (for example, string.printable in Python).
• I recommend you be creative.

Remember, this is popularity-contest! Have fun!

Answer 19

Letter Grade Challenge

Create a program that allows the user to input an int between 1 and 100, then grades that number based on standard US letter grades, printing the grade character as a result. Please use Java for this challenge, and like usual code golf challenges, the smallest answer (bytes) wins. For example, if input is 90, then you display A.

Answer 20

Smallest code to import in G++

Given some head files that need to import, return the shortest code to do so.

1. You are allowed to access include/
2. You should consider both #include <xxx> and #include "xxx"(used in e.g. backward/hash_set #include "backward_warning.h"), but not #import (std don't use #import)

Sample input ['string']

Sample output #import<map>

Related

1. What more assumption necessary? (#if don't effect imported heads?)
2. Time limit necessary?

code-golf parsing c++

Answer 21

Shortest Possible 240 Sided Die Program: Using No Constant Greater than 6

code-golf

Have you ever played Yahtzee with a 240-sided die? No, probably not. Anyway, I came up with the idea of a 240-sided die program, but to make it hard, you cannot use a constant with an absolute value greater than 6. For example, randInt(1,240) wouldn't work. The chances of any number 1-240 must be completely equal, and using expressions that represent numbers with an absolute value larger than 240 is not allowed. For example, randInt(1,4*6*2*5) is against the rules, since 4*6*2*5 evaluates to 240. Standard loopholes prohibited, and you're code golfing.

Answer 22

Merge two code in two languages into a polyglot.

E.g. If you choose C & Python 3, you can merge

main(){puts("a");}

and

print(6)

into

#define print(x) main(){puts("a");}
print(6)

popularity-contest (for it's hard to have a score on language difficulty, optimizy, etc.)

Answer 23

I recently made a language called bit, and your challenge is to create a valid program that takes 2 numbers from STDIN, and outputs the sum of them. You may assume the numbers are no more than 5 digits, and your output doesn't need to be more than 5 digits long

Bit Specification

You can find the specification and an interpreter at the GitHub repo

Answer 24

Count up to N without math or inbuilds

Idea:

The challenge is the following: count from 0 up to N without using mathematical operations or other (counting, list or whatever) inbuilds. You handle the incoming number N as a string on which you can't apply mathematical operations like addition or substraction for example. Also don't use list things like print [0..N] or something other inbuilt of your language. Counting inside arrays, for example at index x+1 or something like that to get position after another is allowed. But you must not apply any (mathematical) operations on the numbers between 0 and N itself.

Think that you are like a small child and don't know anything about maths. You only know: after 0 comes 1, after 1 comes 2 ... after 8 comes 9 and after 9 comes 0 and you have to "increment" the number in front of it.

Examples:

• So after the number 9 (with leading, but not outwritten zero) comes, you write zero and place the number 1 in front of it for 10.
• For 19 you write 0 and "increment" the number in front to the next one, making it 20.
• For 399 you do: last 9 goes to zero, 9 in front goes to 0 too and the 3 goes to 4, making it 400.

Task:

Write a function or program which takes N via the way you want to as its input.
Output the numbers from 0 up to N (element after element or once as a list)
Important: use a seperator as 01234567891011 will become unreadable with larger numbers

Test Case:

Taking a string of seperated numbers and your seperator, you can check your answer here.

Ah, and also don't forget that this is code-golf, so shortest answer in bytes will win. Also, all standard loophole rules and so on apply (you should know from all the other challenges!)

---

Sandbox

I hope this challenge has never been here, I did not found it while searching trough the already asked challenges (maybe I did not found it because I did not knew the correct english words to search for because english is not my first language). Thank you already in advance for helping to improve this challenge.

Tags:

counting, code-golf

Answer 25

Thoughts on a scoring system that levels the playing field between golfing languages and common languages.

Divide the byte length of a program by a "popularity" metric e.g.

• Wikipedia page views in the last 30 days (or esolangs.org)
• Wikipedia edits
• questions on Stack Overflow tagged with that language

Idea would be to encourage golfing in languages used day to day rather than the languages written purely for the purpose of golfing.

Pros

• Code Golf questions often reach the "Hot network questions" sidebar but then new/unfamiliar users are met with incomprehensible code, this could reduce that
• encourage new users to attempt an answer
• whilst users are encouraged to compete with others in the same language, the overall winner normally gets the accepted answer, this could help that

Cons

• this is Code Golf, so least bytes is the goal!
• people have put immense effort into creating the golfing languages and that shouldn't be punished
• finding/creating a "good" popularity metric is probably going to be a lot of work

Case studies

Rescoring Covfefify a string by dividing the length by * wikipedia (or eslangs.org if no wiki page) number of edits * 1000. Then rounded down.

Lang - OG score - Edits - New score

Jelly - 57 - 9 - 6333

JavaScript - 103 - 7695 - 13

Jelly - 39 - 9 - 4333

C - 175 - 8659 - 20

CJam - 56 - 9 - 6222

Perl 5 (Perl) - 71 - 4133 - 17

PHP - 121 - 11287 - 10

Pyth - 54 - 22 - 2454

Python 3 (Python) - 139 - 8850 - 15

Java 8 (Java) - 222 - 8978 - 24

Haskell - 136 - 2089 - 65

Ruby - 90 - 2936 - 30

Results in a HTML table

<google-sheets-html-origin style="color: rgb(0, 0, 0);"><table xmlns="http://www.w3.org/1999/xhtml" cellspacing="0" cellpadding="0" dir="ltr" border="1" style="table-layout: fixed; font-size: 10pt; font-family: Arial; width: 0px; border-collapse: collapse; border: none;">
  <thead>
    <tr style="height: 21px;">
      <th>Lang</th>
      <th>OG score</th>
      <th>Edits</th>
      <th>New score</th>
      <th>Log(edits) score</th>
    </tr>
  </thead><colgroup><col width="100"><col width="100"><col width="100"><col width="100"><col width="100"></colgroup>
  <tbody>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Jelly&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Jelly</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:57}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">57</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:9}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">9</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:6333.333333333333}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">6333</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:59.733243317247464}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">59.73324332</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;JavaScript&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">JavaScript</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:103}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">103</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:7695}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">7695</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:13.385315139701104}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">13</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:26.50398111914659}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">26.50398112</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Jelly&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Jelly</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:39}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">39</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:9}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">9</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:4333.333333333333}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">4333</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:40.870113848643}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">40.87011385</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;C&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">C</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:175}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">175</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:8659}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">8659</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:20.21018593371059}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">20</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:44.44480858549206}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">44.44480859</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;CJam&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">CJam</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:56}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">56</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:9}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">9</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:6222.222222222223}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">6222</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:58.68529168010277}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">58.68529168</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Perl 5 (Perl)&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Perl 5 (Perl)</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:71}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">71</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:4133}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">4133</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:17.17880474231793}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">17</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:19.633514701742165}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">19.6335147</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;PHP&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">PHP</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:121}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">121</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:11287}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">11287</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:10.720297687605209}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">11</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:29.857533728767567}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">29.85753373</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Pyth&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Pyth</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:54}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">54</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:22}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">22</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:2454.5454545454545}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">2455</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:40.22578042776074}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">40.22578043</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Python 3 (Python)&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Python 3 (Python)</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:139}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">139</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:8850}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">8850</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:15.706214689265536}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">16</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:35.21712638535709}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">35.21712639</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Java 8 (Java)&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Java 8 (Java)</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:222}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">222</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:8978}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">8978</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:24.72711071508131}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">25</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:56.157327114648886}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">56.15732711</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Haskell&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Haskell</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:136}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">136</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:2089}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">2089</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:65.10292005744375}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">65</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:40.96461499473064}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">40.96461499</td>
    </tr>
    <tr style="height: 21px;">
      <td data-sheets-value="{&quot;1&quot;:2,&quot;2&quot;:&quot;Ruby&quot;}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom;">Ruby</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:90}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">90</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:2936}" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">2936</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:30.653950953678475}" data-sheets-numberformat="{&quot;1&quot;:2,&quot;2&quot;:&quot;0&quot;,&quot;3&quot;:1}" data-sheets-formula="=R[0]C[-2]/R[0]C[-1]*1000" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">31</td>
      <td data-sheets-value="{&quot;1&quot;:3,&quot;3&quot;:25.953382726479024}" data-sheets-formula="=R[0]C[-3]/LOG(R[0]C[-2])" style="border: 1px solid rgb(204, 204, 204); overflow: hidden; padding: 2px 3px; vertical-align: bottom; text-align: right;">25.95338273</td>
    </tr>
  </tbody>
</table></google-sheets-html-origin>

Just using the number of edits makes the golfing languages irrelevant. The log(edits) brings everything into quite a nice grouping.

Answer 26

code-challenge

Delete or a file disapear as fast as possible!

Requirements to participate:

• have a HDD hard drive, witch you will use to compete
• Use Windows (version 7 or more recent) for this challenge.

Assume that you already know the file path. no input needed.

You can use any language you want for this challenge, but you will need to explain the logic in your code.

You will delete a 2GB file.

How do you win?

You win this challenge by creating a piece of code that can delete a file in the OS as fast as possible, the winner is the one with less time to delete a file.

Answer 27

Worst language Ever

Let's find out the worst language.

Make a program that does anything that is shortest.

The worst language would be the longest of all.

I'll go with C first.

C (gcc), 15 bytes

f(){puts("1");}

Try it online!

It prints 1.

It does print something and it is the shortest code.

Swift 4, 8 bytes

print(2)

Try it online!

It prints 2. It does print something that is shortest.

Answer 28

Divisibility by 4

Your job is to write a program that checks divisibility of an integer by 4.

Restrictions:

You can't use:

• modulo
• binary shift/rotates
• Divisions

You must instead do it like a HUMAN DOES by checking the last 2 digits and output a truthy value when is divisible and a falsey when not.

Non-printable characters; golfing-dedicated, whitespace and esoteric languages are forbidden.

The winner will be the code that has less characters, where white space doesn't count (tabs, spaces and newlines).

Answer 29

Write the worst Hello World program you can [popularity-contest] [super rough]

Who needs conventions? Write the most terrible Hello World program you can think of. Inefficiency, spaghetti code, you name it. Add a few gotos here and there to spice it up. Write code that has gone against everything you've ever been taught.

Be creative. This isn't about obfuscation: it's about bad code quality. Try making up your own ways of writing inefficient or unadaptable code. Have fun!