Please try to tie or beat helloperson-test-acc's 38 byte happy numbers' solution! It sounds impossible unless there is a very short (at most 12 bytes) magic formula (next happy, nth happy, happy gap, etc.)!!! Use PySearch to find a formula in any style!!!
⛳
133 / 133 Holes
🔣
65 / 65 Langs
🏆
106 / 116 Cheevos
📅
3rd in Pascal and 232nd overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 217 | 217 | |
| 218 | 218 | |
| 220 | 220 | |
| 221 | 221 | |
| 222 | 222 | |
| 226 | 226 | |
| 236 | 236 | |
| 237 | 237 | |
| 254 | 254 | |
| 255 | 255 | |
| 256 | 256 | |
| 257 | 257 | |
| 258 | 258 | |
| 260 | 260 | |
| 280 | 280 | |
| 281 | 281 | |
| 282 | 282 | |
| 287 | 287 | |
| 297 | 297 | |
| 518 | 518 |