New answers tagged

2

><>, ~\$4.24 \times 10^{1177545600} \$ '****l(?;n Try it online! Outputs the ordinal value of * (42) around 4088700 times. Every loop it only terminates if the length of the stack is higher than multiplying the ordinal values of l(?;n = 108*40*63*59*110 = 1766318400, but since it only pushes 3 elements to the stack each time, this takes a long ...


0

1+, score 256 11+"*"*"*: Begin with 2, square three times, and we get 256. I believe this is optimal.


Top 50 recent answers are included