@Emigna Is þ (Push the digits of a) bugged at the moment? þ with an integer input simply stays unchanged, and þO doesn't sum the digits either (it also stays the same).. Or am I misunderstanding something obvious about how to use þ?

I guess I can use γO for now, but still..

@Adnan Is þ (Push the digits of a) bugged? It doesn't seem to do anything at the moment. 180 remains 180, and þO remains 180 as well (instead of 9). Also, γO as temporarily workaround works for 180, but not for something like 2114 (['2', '11', '4'] instead of [2, 1, 1, 4]).

Ah, S as work-around works fine as well. Will use that for now then.

@KevinCruijssen þ removes non-digits, so "test123" becomes 123

@KevinCruijssen To sum digits of a number you use SO, yes :)

@Emigna Ah, that indeed makes sense. Thanks for the clarification!

@Emigna Small question now that you are there anyway. Let's say I have an equation resulting in 1, and a list resulting in multiple 1s, what is the fastest way to check if everything is a 1? i.e. 1, [1, 1, 1] -> 1?

@KevinCruijssen P* = product, multiply

And if you need 1 for all-ones and 0 for not all-ones, you can do PΘ (ie if you need them to be consistent like that).

@Mr.Xcoder @Emigna Thanks both :)

Does F (loop in range [0, n)) work differently from G (loop in range [1, n)) somehow? My code works completely fine when I use F, but when I change it toG it does not.. :S Here is my code btw: codegolf.stackexchange.com/a/164415/52210. I figured changing NT›i¨} to a bit-wise OR at the end checking if N is below 10 (T) might save a byte or two, but it should exclude 0.. Also, any golfing tips in this answer of mine?

@KevinCruijssen That is very strange. I've never had an issue with G before. It appears to be totally broken.

I'll try and have a look at your answer tomorrow and see if I can spot any saveable bytes