« first day (226 days earlier)      last day (886 days later) » 

2:50 AM
0
A: Sandbox for Proposed Challenges

Nigel BessDefinition Given some string return an integer whose digits are the number ocurrences of a-z (case insensitive) in that string. Any character with 0 instances is skipped. Characters with 10 or more instances will define 2 or more digits of the returned integer. For example, aaaaaaaaaaaaaaaaaaaaaa...

 
0
Q: Return all letter counts as an integer

Nigel BessDefinition Given some string return an integer whose digits are the number ocurrences of a-z (case insensitive) in that string. Any character with 0 instances is skipped. Characters with 10 or more instances will define 2 or more digits of the returned integer. For example, aaaaaaaaaaaaaaaaaaaaaa...

 
2 messages moved from The Nineteenth Byte
 
 
6 hours later…
8:47 AM
0
A: Sandbox for Proposed Challenges

AnttiPKolmogorov-simple numbers If you visit Code Golf often, you may have heard of Kolmogorov complexity. It's usually defined as the amount of bytes required to express some string in a programming language. Here the Kolmogorov-complexity of a natural number is defined similarly: the number of bytes ...

 
8:58 AM
1 message moved from The Nineteenth Byte
 

« first day (226 days earlier)      last day (886 days later) »