Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with restricted-memory
Search options answers only
not deleted
user 21487
For challenges with a restriction placed on the amount of memory that can be allocated. This can be through direct limits (e.g. 64 bytes) or through big-O-notation (e.g. O(n log(n))).
2
votes
Count up forever
Jelly, 3 bytes
Ṅ‘ß
Try it online! Be careful though, since this is a long output after all!
Ṅ Print with newline
‘ Increment
ß Call current link (function) again
…
- 61.9k
4
votes
Count up forever
Alice, 6 bytes
h .\
O
Try it online!
Alice is a 2D language with two modes - Cardinal (up/down/left/right) for integers and Ordinal (diagonal) for strings. For this challenge we need Cardinal to c …
- 61.9k
66
votes
Count up forever
Labyrinth, 5 bytes
):
\!
♫ The IP in the code goes round and round ♫
Relevant instructions:
) Increment top of stack (stack has infinite zeroes at bottom)
: Duplicate top of stack
! …
- 61.9k