67
votes
43
votes
Fastest Mini-Flak Quine
Mini-Flak, 6851113 cycles
The program (literally)
I know most people aren't likely expecting a Mini-Flak quine to be using unprintable characters and even multi-byte characters (making the encoding ...
33
votes
30
votes
26
votes
Tips for Golfing in Brain-Flak
Use the Third Stack
If you have read the title you might be a bit confused. Surely there are only two stacks in Brain-Flak? However I assure you that it exists and it is one of the most powerful if ...
- 100k
24
votes
Surprise Party for Brain-Flak
Haskell (before GHC 8.4), (10119 7767 7626 7540 bytes), score 15 14 10
...
- 26.3k
23
votes
Tips for Golfing in Brain-Flak
Finding modulus/remainder
Finding n modulo m is one of the basic arithmetic operations, important for many challenges. For cases m > 0 and n >= 0, the following 46-byte snippet may be used. It ...
- 31.5k
22
votes
Surprise Party for Brain-Flak
Python 2, 39 37 36 34 bytes
-1 thanks to dzaima
-2 thanks to Erik the Outgolfer
...
- 100k
20
votes
18
votes
Fastest Mini-Flak Quine
128,673,515 cycles
Try it online
Explanation
The reason that Miniflak quines are destined to be slow is Miniflak's lack of random access. To get around this I create a block of code that takes in a ...
- 100k
16
votes
16
votes
14
votes
13
votes
Accepted
Balance the Brackets
Retina, 254 252 264 248 240 232 267 bytes
Thank you to @AnthonyPham, @officialaimm, and @MistahFiggins for pointing out bugs
...
- 7,277
12
votes
Tips for Golfing in Brain-Flak
Push-Pop Redundancy
This is a big one. It is also a little bit of a nuanced one.
The idea is that if you push something and then pop it without doing anything you should not have pushed it at all.
...
- 100k
12
votes
Find the First Bracket Match
05AB1E, 17 16 10 bytes
-1 thanks to carusocomputing
-6 thanks to Adnan for his amazing insight that "after incrementing, the second last bit is 0 for an opening bracket and 1 for an closing ...
- 11.7k
12
votes
Surprise Party for Brain-Flak
Jelly, 7 6 bytes
“”Lb⁹Ọ
Inside the “” you need to put the output of this Jelly program:
...
- 40.6k
12
votes
Surprise Party for Brain-Flak
Retina, 59 - 24 = 35 bytes
Su{p()se!¶Ha<<>[]i{thd}>,[](a)n-Fl}k!
T`<>()[]{}`\pyri Bra
Try it online! By comparison, the boring solution takes ...
- 177k
11
votes
Find the First Bracket Match
Vim, 23 bytes
:se mps+=<:>
%DVr<C-a>C1<esc>@"
Try it online!
I'm really sad about this answer. This solution is beautifully elegant and short, ...
- 59.6k
11
votes
10
votes
Find the First Bracket Match
Retina, 26 24 bytes
M!`^.(?<-1>([[({<])*.)*
Try it online!
Result is 1-based.
Explanation
A very different Retina solution that is essentially based ...
- 197k
10
votes
Horizontally mirror a brainflak program
Charcoal, 3 bytes
Ｓ‖Ｔ
Try it online! Link is to verbose version of code. Explanation: Ｓ reads the input and implicitly echos ...
- 177k
9
votes
Surprise Party for Brain-Flak
Haskell, (12006 13485 bytes), score 18 17
EDIT:
-1 byte: Got the toEnum version to work without extensions by moving the toEnum...
- 7,464
8
votes
Golf a Brain-Flak Integer
Lua 5.3, 57522
I actually started working on this back when the question was posted, but forgot about it until the Brain-Flak anniversary.
...
- 526
8
votes
8
votes
8
votes
Surprise Party for Brain-Flak
Japt, 19 14 13 10 9 8 bytes
"(()()...()()<"q>)m(l)m(d)q
where the string at the beginning is:
...
- 50.1k
7
votes
Accepted
7
votes
Text to Brain-Flak
Python 3, 17744 bytes
Edit: I've added a couple of options to help golf in stack safe situations.
...
- 47.5k
Only top scored, non community-wiki answers of a minimum length are eligible