I've been hanging out on this site for a while now and answering a number of challenges, and I came up with a possibly good, if kinda meta idea for a challenge, would love any input on this.

Edit: It seems like this challenge has been pretty well received here on the sandbox, so I think I will post it properly within a few hours unless there are any objections.

Output this string from the kolmogorov-complexity tag info page

kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd" as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the simplest way to output it. I would like to test this statement, and thus your challenge is to output this string, without using a literal representation of it.

Rules

• Your code must take no input, and output exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
• No submitting the trivial solution of your language's equivalent of print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
• Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.

code-golf, so lowest bytecount is best score, but please also list the difference in length between your bytecount and the bytecount of your language's trivial solution with your score.

Tags: code-golf, kolmogorov-complexity

Edit: Posted.

Output this string from the kolmogorov-complexity tag info page

I've been hanging out on this site for a while now and answering a number of challenges, and I came up with a possibly good, if kinda meta idea for a challenge, would love any input on this.

Output this string from the kolmogorov-complexity tag info page

kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd" as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the simplest way to output it. I would like to test this statement, and thus your challenge is to output this string, preferably without simply using the literal representation.

Rules

• Your code must take no input, and output exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
• No submitting the trivial solution of your language's equivalent of print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
• Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.

code-golf, so lowest bytecount is best score.

Tags: code-golf, kolmogorov-complexity

I've been hanging out on this site for a while now and answering a number of challenges, and I came up with a possibly good, if kinda meta idea for a challenge, would love any input on this.

Edit: It seems like this challenge has been pretty well received here on the sandbox, so I think I will post it properly within a few hours unless there are any objections.

Output this string from the kolmogorov-complexity tag info page

kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd" as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the simplest way to output it. I would like to test this statement, and thus your challenge is to output this string, without using a literal representation of it.

Rules

• Your code must take no input, and output exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
• No submitting the trivial solution of your language's equivalent of print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
• Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.

code-golf, so lowest bytecount is best score, but please also list the difference in length between your bytecount and the bytecount of your language's trivial solution with your score.

Tags: code-golf, kolmogorov-complexity

I've been hanging out on this site for a while now and answering a number of challenges, and I came up with a possibly good, if kinda meta idea for a challenge, would love any input on this.

Output this string from the kolmogorov-complexity tag info page

kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd" as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the simplest way to output it. I would like to test this statement, and thus your challenge is to output this string, preferably without simply using the literal representation.

Rules

• Your code must take no input, and output exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
• No submitting the trivial solution of your language's equivalent of print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
• Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.
• Per idea from @ophact, you are allowed to read data from the internet from the info page for kolmogorov-complexity, but you may not use any other external sources, including URL shortener websites.

code-golf, so lowest bytecount is best score.

Tags: code-golf, kolmogorov-complexity

I've been hanging out on this site for a while now and answering a number of challenges, and I came up with a possibly good, if kinda meta idea for a challenge, would love any input on this.

Output this string from the kolmogorov-complexity tag info page

kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd" as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the simplest way to output it. I would like to test this statement, and thus your challenge is to output this string, preferably without simply using the literal representation.

Rules

• Your code must take no input, and output exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
• No submitting the trivial solution of your language's equivalent of print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
• Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.

code-golf, so lowest bytecount is best score.

Tags: code-golf, kolmogorov-complexity