Divisors in Fortran in Chars Play Hole
18th in Fortran and 5,242nd overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 1,415 | 1,415 | |
| 2,219 | 2,219 | |
| 1,712 | 1,712 | |
| 2,927 | 2,927 |
The Gray Code Decoder and Gray Code Encoder holes will go live in approximately . Why not try and solve them ahead of time?
+⟜≡⇌+÷5˙⊞⊃(>ⁿ₄τ+∩°√∩-₅₀|↧⊃<₂₅₀>₂₀+∩°√∩-₂₆)⇡100
💰
Sponsor
⛳
126 / 126 Holes
🔣
64 / 64 Langs
🏆
104 / 109 Cheevos
📅
18th in Fortran and 5,242nd overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 1,415 | 1,415 | |
| 2,219 | 2,219 | |
| 1,712 | 1,712 | |
| 2,927 | 2,927 |