The Nineteenth Byte

Posting good challenges frequently is the second best way to reliably gain rep

The first is, well, FGITW

Wasif

@Bubbler yes thats my open secret to get rep quickly

hyper-neutrino

unfortunately, yep :/ the other thing is having high-quality questions that are still accessible enough to hit HNQ because unfortunately harder challenges get fewer answers and therefore don't hit the algorithm

A: Sandbox for Proposed Challenges

7:18 AM

It does pick up some with few answers sometimes

hyper-neutrino

7:30 AM

true. maybe i'm wrong, but more consistently i feel like higher answer count is quite heavily rewarded

granted, saying "write a challenge that'll get a lot of upvotes and a good amount of answers" isn't that helpful cuz then the advice for getting rep is just "write good posts" where the tip to write good posts is "write good posts"

Lyxal

@Wasif it works

Wasif

Yeah it works now @Lyxal thanks for fixing

New Sandboxed Posts

7:56 AM

0

Generate a uncomputable number An uncomputable number is a number that some digit can't be computed in finite time. Now you're to generate and output one of them. You can(and need to) use \b to undo an outputted byte, but every byte should stop changing from some time. An example solution, assumi...

New Sandboxed Posts

8:20 AM

0

A: Sandbox for Proposed Challenges

Base-ically god (WIP) Story The god of base is opening (his/her) heaven’s gate for one person to join the base party. You, as one of the believer, wants to follow (his/her) step to ascend to heaven. But only one can get in. The god sent me to post this question to let you prove that you are worth...

8:57 AM

Rust-based homegrown TIO template is up!

5

Wasif

nice

(Not sure how many users are familiar enough with Rust to actually use it, but anyway)

pxeger

9:08 AM

@Bubbler I don't quite understand what you mean by "static-page Try Online interface"

@pxeger The core interpreter is loaded as a Wasm package, so it runs in the browser and you don't need a server to run your code.

pxeger

oh right

The server just needs to statically host the single page and the necessary js/wasm files.

9:41 AM

CMC: Given an list/array of 8-bit integers (no other input acceptable, but list can have the length or a zero terminator if necessary), convert the byte values from UTF-8 to 32-bit Unicode and count the number of code points

@Neil That is, simply count the number of characters in a byte stream when interpreted as UTF-8?

@Neil Rust, 48 bytes: |x|String::from_utf8(x).unwrap().chars().count()

I suspect it might be possible to count the starting positions directly, but I'm too lazy to look up the details

(from_utf8_lossy is slightly shorter, 45 bytes)

10:12 AM

@Bubbler there are other ways of expressing the problem, yes

@Neil Isn't the conversion to 32-bit Unicode an unnecessary (and unobservable) requirement? You just want to know how many chars there are, no?

In other words you want to know how many of the bytes begin with 0 or with 11.

@Adám ... as I was saying to @Bubbler...

@Neil Can the integers be signed?

@Adám of course

@Neil Dyalog APL, 13 bytes (takes unsigned ints): ≢'UTF-8'∘⎕UCS Try it online!

10:24 AM

huh, I would have thought signed ints would have been better

I guess your builtin is just too short

Yeah.

@Neil Dyalog APL, 18 bytes (takes signed ints, uses no built-ins): (⊃1⊥1 1∘⍷∨~)11⎕DR⍪ Try it online!

This one actually looks at the bit-patterns.

@NewMainPosts oof, -8, harsh

it's not good, but it's not -8 bad...

Potentially doing harm to a 3rd party service is that bad, intended or not

fair point

11:22 AM

wth is going on rn

?

Lyxal

Wdym?

I haven't committed any more crimes than usual

(which btw is 0)

oh by the way, CMC*: code the up-arrow function as in this article

in what format

any, as long as it can return the correct value (such as into a variable) or print the correct value to STDOUT or the like

11:26 AM

@StackMeter Should we take the number of up arrows as an argument?

if you are taking input (and there's a -20% bonus if you do), you will get three numbers, the first number, the number of arrows, and the second number, in that order

@Adám if you are taking input, yes

by the way, I'm posting this as a challenge, so if you have anything to add, please do

@StackMeter Dyalog APL, 6 bytes-20%=4.8 bytes?: ⎕*⍣⎕⊢⎕ Try it online!

No wait, that may just be ↑↑

that works, but fails for a,b >= 5,4 or 4,5

also you should try to implement arbritrary precision integers

like Java and JavaScript did with the BigInt library (these won't be counted in your code)

so, to reiterate, e as high of a precision as possible to stare the maximum number possible, and libraries aren't included in your code though must be specified

@StackMeter Please don't mix unrelated challenges.

ok scratch that

give me a second

11:35 AM

I would recommend using the sandbox.

well it's just a cmc

7 mins ago, by StackMeter

by the way, I'm posting this as a challenge, so if you have anything to add, please do

well, gotta go make a sandbox entry