Lolololololololololololol

Question

Let us take a break from the brain-wrecking questions and answer some of the simpler ones

You have recently read something extremely funny, and want to express your laughter to the world! But how can you?

Task

You have to display the string: Lolololololololololololololololololololololololololololololololololololololololololololololololololololololololol...

...to STDOUT.

The string should be of infinite length, or will constantly be printed until the end of time.

It is just as simple!

But remember, this is code-golf, so the source code must be as short as possible!

Note: Some languages may throw errors since excecution can be timed out, or for other reasons. That is okay! It can be weird when you laugh forever!

Good luck!

By the way, standard site rules will allow functions which return the result (e.g. in an infinite generator) making the print to STDOUT part redundant unless you specify that this must be a full program (which I'd advise against, but is allowed). — Jonathan Allan, Commented Sep 12, 2020 at 13:21
I don't understand why this was closed. The other challenge is much simpler. — the default., Commented Sep 12, 2020 at 19:28
@thedefault. I don't understand your comment. The difference (requires an extra character to be outputted before the program, and outputs two characters instead of one) is fairly trivial. As you can see, if we remove the print L part and change ol to A, we get an SVL answer! — TwilightSparkle, Commented Sep 13, 2020 at 11:56
I have reopened this question. I believe the small difference presents interesting golfing opportunities in some languages and, furthermore, that simply porting a solution might well not be competitive. One only needs to look at a few of the answers to see some interesting differences. If people disagree then by all means vote to close again. — Jonathan Allan, Commented Sep 24, 2020 at 8:27

Mukundan314 · Accepted Answer · 2024-05-09 11:19:18Z

2

Acc!!, ⁴⁸ 42 bytes

Count i while 1 {
Write 108-0^i*32+i%2*3
}

Try it online!

edited May 9 at 11:19

answered Apr 15 at 11:20

Mukundan314

12.7k1 gold badge16 silver badges58 bronze badges

Add a comment |

Gilbert Hastag · Accepted Answer · 2024-08-08 14:17:47Z

2

?Q?, 10 bytes

this is the code:

#[L]$[ol]*

explained

#[l] add initial l. will be skipped after first iteration
[ol] set string to ol
$* print and go back to start

edited Aug 8 at 14:17

answered Aug 7 at 15:12

Gilbert Hastag

212 bronze badges

\$\begingroup\$ Welcome to Code Golf, and nice first answer! On CGCC, we require languages to have an implementation, so please link to one if it exists. \$\endgroup\$
– emanresu A
Commented Aug 8 at 3:09
\$\begingroup\$ @emanresuA sorry. i did nit know that and it does nit exist \$\endgroup\$
– Gilbert Hastag
Commented Aug 8 at 6:15
\$\begingroup\$ Here's an implementation I hacked together. It's not quite spec-compliant (and I'm not entirely sure what the spec is in places), but it should work for this. Also, your code doesn't quite fulfil the required task - it prints the whole string forever, so it prints lol, then lolol, then lololol. #[L]$[ol]* does the right thing for the same bytecount of 10 bytes. Feel free to modify this implementation to make it work properly. \$\endgroup\$
– emanresu A
Commented Aug 8 at 7:07
\$\begingroup\$ thx. ill check it out. and thx for the solution thats fixed @emanresuA \$\endgroup\$
– Gilbert Hastag
Commented Aug 8 at 12:02
\$\begingroup\$ you compiler works like it needs too. thx @emanresuA \$\endgroup\$
– Gilbert Hastag
Commented Aug 8 at 12:06

| Show 1 more comment

emanresu A · Accepted Answer · 2021-05-11 08:57:33Z

1

Splinter, 11 bytes

A{\o\lA}\LA

Try it online!

Interpreter breaking version. Would run forever otherwise.

answered May 11, 2021 at 8:57

emanresu A

44.2k5 gold badges100 silver badges240 bronze badges

Add a comment |

LorenDB · Accepted Answer · 2021-05-15 13:59:47Z

1

Barrel, 8 bytes

L#∞(ol

Implicitly prints L, then infinitely loops over implicitly printing ol. The parenthesis makes o and l into one statement, since a loop can only execute one statement. (In barrel, parentheses are self-closing.)

answered May 15, 2021 at 13:59

LorenDB

3913 silver badges7 bronze badges

Add a comment |

J. А. del Rio - слава СССР · Accepted Answer · 2021-07-23 08:32:42Z

1

Lua, 31 bytes

u=io.write u"L"::x::u"ol"goto x

Try it online!

edited Jul 23, 2021 at 8:32

answered Jul 23, 2021 at 8:15

J. А. del Rio - слава СССР

3393 silver badges6 bronze badges

1

\$\begingroup\$ Has to capitalize first L so here is the version. \$\endgroup\$
– user100411
Commented Jul 23, 2021 at 8:18
\$\begingroup\$ @tailsparkrabbitear Nice, thanks \$\endgroup\$
– J. А. del Rio - слава СССР
Commented Jul 23, 2021 at 8:31

Add a comment |

user105238user105238 · Accepted Answer · 2021-07-26 06:55:44Z

1

GForth 30 bytes

: A ." L" 0 1 do ." ol" loop ;

answered Jul 26, 2021 at 6:55

user105238

\$\begingroup\$ You can save two bytes by removing the spaces after the ending double-quotes. (e.g. ." L"0 and ." ol"loop). Forth looks for the ending double_quote differently than it processes other input \$\endgroup\$
– reffu
Commented Aug 8 at 13:48

Add a comment |

Taco · Accepted Answer · 2021-08-05 22:40:45Z

1

Batch (30 Bytes)

@ECHO OFF
ECHO L
:a
ECHO ol
GOTO :a

If you're willing to ignore @ECHO OFF, then it's 25 bytes instead.

answered Aug 5, 2021 at 22:40

Taco

5312 silver badges15 bronze badges

1

\$\begingroup\$ You could get rid of @echo off without printing echo stuff by prefixing each line (except :a) with @s. Plus, as an alternative solution, you can output without newline by doing set/p=Text to output<nul \$\endgroup\$
– FZs
Commented Aug 19, 2021 at 12:04

Add a comment |

NoLongerBreathedIn · Accepted Answer · 2021-08-19 02:05:30Z

1

Haskell, 25 bytes

main=putStr$'L':cycle"ol"

To return an infinite string, only 13 bytes required:

'L':cycle"ol"

answered Aug 19, 2021 at 2:05

NoLongerBreathedIn

1,8078 silver badges11 bronze badges

Add a comment |

FZs · Accepted Answer · 2021-08-19 11:53:34Z

Z80Golf, 9 bytes

00000000: 3E 4C FF 3B 3B F6 20 EE
00000008: 03

Try it online!

Explanation

  ld a, $4C ; Load the ASCII code of "L" into a
  rst $38   ; Jump past the end of the program (print "L") and push the next address (loop) to the stack

loop:
  dec sp    ; \
  dec sp    ; _} Push the last value (the address of loop) back to the stack by moving the stack pointer by 2 downwards
  or $20    ; Switch from uppercase to lowercase (idempotent). $4C ("L") -> $6C ("l"), $6C ("l") -> $6C ("l")
  xor $03   ; Toggle A between $6C ("l") and $6F ("o")

; ... the program runs (executes NOPs) until PC = $8000 where it prints A, then returns to the address on the stack (which is always loop)

score 1 · Accepted Answer · 2021-09-29 14:14:35Z

1

BrainCrash, 43 22 bytes.

^^+++++++++++.>>[.<.>]

I'll golf off later.

Try it online!

edited Sep 29, 2021 at 14:14

answered Sep 29, 2021 at 14:09

user100411

Add a comment |

ovs · Accepted Answer · 2021-09-29 14:57:46Z

1

Gaia, 9 bytes

:p⌋
Lo”↑∞

Try it online!

The first line is a helper function which prints a copy of its input and returns its input converted to lowercase.

Lo” pushes the string "Lo" to the stack, and ↑∞ calls the above function infinitely. Leading quotation marks can be omitted at the start of a line.

The same could be done in a single line with Lo”⟨:p⌋⟩∞.

answered Sep 29, 2021 at 14:57

ovs

60.6k3 gold badges47 silver badges161 bronze badges

Add a comment |

Larry Bagel · Accepted Answer · 2021-12-23 00:59:39Z

1

JavaScript (Node.js), 49 bytes

for(i=0;++i;){process.stdout.write(i<2?"L":"ol")}

Try it online!

answered Dec 23, 2021 at 0:59

Larry Bagel

4,2191 gold badge11 silver badges44 bronze badges

Add a comment |

sinvec · Accepted Answer · 2022-03-07 15:57:42Z

1

Pyth, 8 bytes

p\LWp"ol

Try it online!

answered Mar 7, 2022 at 15:57

sinvec

1,9936 silver badges28 bronze badges

Add a comment |

Ginger · Accepted Answer · 2022-03-07 20:21:41Z

1

Etch, 23 bytes

do
:outnnl"lo";
forever

answered Mar 7, 2022 at 20:21

Ginger

5,9801 gold badge21 silver badges54 bronze badges

\$\begingroup\$ This looks like it outputs "lololololol", you need a capital L. \$\endgroup\$
– emanresu A
Commented Aug 6, 2022 at 7:35

Add a comment |

BowlingPizzaBall · Accepted Answer · 2022-03-18 15:56:11Z

1

Befunge-98 (PyFunge), 15 12 11 bytes

'Lv
'l>,'o,

Try it online!
-3 bytes thanks to @emanresuA
-1 byte thanks to @WheatWizard

Befunge-93 compatible version (1 byte more):

L"v
, <,"ol"

Try it online!

edited Mar 18, 2022 at 15:56

answered Mar 17, 2022 at 18:48

BowlingPizzaBall

4910 bronze badges

\$\begingroup\$ Welcome to Code Golf, and nice first answer! Be sure to check out our Tips for golfing in Befunge page for ways you can golf your program! I think this can be 12 bytes with some rearranging. \$\endgroup\$
– emanresu A
Commented Mar 17, 2022 at 19:26
\$\begingroup\$ @emanresuA thanks! However I can't get over the fact that your code produces Llolo... instead of Lolol... \$\endgroup\$
– BowlingPizzaBall
Commented Mar 17, 2022 at 20:12
\$\begingroup\$ Oops. I was close... \$\endgroup\$
– emanresu A
Commented Mar 17, 2022 at 20:17
\$\begingroup\$ @WheatWizard thank you too! \$\endgroup\$
– BowlingPizzaBall
Commented Mar 18, 2022 at 0:28

Add a comment |

Sylvester is on codidact.com · Accepted Answer · 2022-03-26 20:40:20Z

1

Rust, 41 bytes

I know I'm a little late to the party, but I'd though I'd make a Rust contribution. Here's the code:

fn main(){print!("L");loop{print!("ol")}}

Try it online! Note that it will panic on TIO after the output exceeds 128 KiB. But it doesn't panic in my terminal!

answered Mar 26, 2022 at 20:40

Sylvester is on codidact.com

7372 silver badges14 bronze badges

\$\begingroup\$ You can trim this to 30 bytes by using the header and footer sections in TIO to cover the fn main(){ and }. \$\endgroup\$
– Taco
Commented Apr 15 at 16:37

Add a comment |

user111777user111777 · Accepted Answer · 2022-03-31 02:13:43Z

1

PHP (25 chars)

echo'L';for(;;print'ol');

answered Mar 31, 2022 at 2:13

user111777

Add a comment |

Bbrk24 · Accepted Answer · 2022-03-31 04:05:09Z

1

Clojure, 24 bytes

This is my first answer in Clojure; I only started learning it recently.

(pr 'L)(while 1(pr 'ol))

To be honest I'm not quite sure myself why (pr 'ol) works, but it does.

answered Mar 31, 2022 at 4:05

Bbrk24

3,56320 silver badges21 bronze badges

1

\$\begingroup\$ while 1 can be loop[] \$\endgroup\$
– naffetS
Commented Mar 26, 2023 at 21:52
\$\begingroup\$ @naffetS That doesn't work for me. (loop[](pr 'ol)) only prints ol once before returning. \$\endgroup\$
– Bbrk24
Commented Mar 26, 2023 at 22:41
\$\begingroup\$ Nevermind sorry, you would need (recur) \$\endgroup\$
– naffetS
Commented Mar 26, 2023 at 23:41

Add a comment |

code · Accepted Answer · 2022-06-25 02:04:45Z

1

Rust, 41 bytes

fn main(){print!("L");loop{print!("ol")}}

Try it online!

answered Jun 25, 2022 at 2:04

code

5313 silver badges11 bronze badges

Add a comment |

Julian · Accepted Answer · 2022-08-07 07:29:09Z

1

Alice, 10 bytes

"olL"wo~.K

Try it online!

Explanation

"olL"wo~.K
"olL"       Puts `olL` in the stack, `L` on the top
     w   K  Never ending loop
      o     Print the first element of the stack
       ~    Swap the stack
        .   Duplicate the first element of the stack

answered Aug 7, 2022 at 7:29

Julian

3,2467 silver badges17 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2023-03-26 14:37:13Z

1

Thunno, \$ 8 \log_{256}(96) \approx \$ 6.58 bytes

'L[ZL"ol

Attempt This Online!

Explanation

'L        # Push the character "L"
  [       # Forever:
   ZL     #  Print top of stack with no trailing newline
     "ol  #  Push "ol" for the next iteration

answered Mar 26, 2023 at 14:37

The Thonnu

18.3k3 gold badges16 silver badges74 bronze badges

Add a comment |

SuperJedi224 · Accepted Answer · 2023-03-26 17:05:53Z

1

Binary-encoded Golifcal, 13 bytes

Hexdump of binary encoding:

00 70 01 00 4c 18 1b 00 6c 18 00 6f 1d

This binary version can be convered back to a runnable program image using the Encoder included in the github repository for the language, or run directly by adding the -x flag.

Original program image:

enter image description here

Magnified 70x with RGB colors labeled: enter image description here

edited Mar 26, 2023 at 17:05

answered Mar 26, 2023 at 16:26

SuperJedi224

12k1 gold badge45 silver badges68 bronze badges

Add a comment |

roblogic · Accepted Answer · 2023-03-26 17:58:02Z

1

Fortran (GFortran) `--cpp`, 57 bytes

#define p(s)call fput(s)
p('L')
1 p('o');p('l');goto1;end

Try it online!.

I #define a macro p() to save typing call fput('x') for every letter. And good old goto is mostly harmless.

answered Mar 26, 2023 at 17:58

roblogic

4,01218 silver badges23 bronze badges

Add a comment |

Dominic van Essen · Accepted Answer · 2023-03-26 21:10:58Z

1

Nibbles, 5 bytes (10 nibbles)

"L"^~"ol"

Attempt This Online!

answered Mar 26, 2023 at 21:10

Dominic van Essen

36.4k2 gold badges22 silver badges60 bronze badges

Add a comment |

The Empty String Photographer · Accepted Answer · 2023-05-20 16:26:49Z

1

Python, 45 Bytes

print('Lo',end='')
while 1:print('lo',end='')

Try it online!
Seems ungolfable.

answered May 20, 2023 at 16:26

The Empty String Photographer

2,2981 gold badge9 silver badges25 bronze badges

Add a comment |

Bartosz Jabłoński · Accepted Answer · 2023-05-21 20:07:41Z

1

SAS, 42 bytes

SAS gives "the ultimate" answer in 42 bytes ;-)

The code:

data;put'L'@;do while(1);put'ol'@;end;run;

Human readable:

data;
  put 'L' @;
  do while(1);
    put 'ol' @;
  end;
run;

answered May 21, 2023 at 20:07

Bartosz Jabłoński

3011 silver badge6 bronze badges

Add a comment |

Peter · Accepted Answer · 2023-06-03 11:12:12Z

Byte-based instruction jumping, 8 bytes

↑L↑o↑l,L

How it works: When executed, the instructions stored in ↑ moves the instruction pointer to the right, prints the value stored there (L) and moves to the right again, making it point to the second ↑. the second ↑ does the same again, except o is printed instead of L, and the third ↑ prints l and makes the instruction pointer point to ,.

, also makes the instruction pointer move to the right (to the second L), but then it jumps back to the last byte with the same value as the current one (the first L), and moves right once more (to the second ↑). Now it ends up in an infinite loop where it moves forward, prints o, moves forward, prints l, moves forward, jumps to the first L, moves forward, prints o et cetera.

steenbergh · Accepted Answer · 2023-08-04 08:02:22Z

1

Basic, 20 bytes

?"L";:DO:?"ol";:LOOP

Try it online!

answered Aug 4, 2023 at 8:02

steenbergh

8,1441 gold badge25 silver badges41 bronze badges

Add a comment |

l4m2 · Accepted Answer · 2023-11-20 16:10:24Z

1

JavaScript (Node.js), 41 bytes

for(x='L';process.stdout.write(x);)x='ol'

Try it online!

-2 from Dom Hastings

edited Nov 20, 2023 at 16:10

answered Nov 20, 2023 at 8:06

l4m2

28.4k2 gold badges25 silver badges103 bronze badges

\$\begingroup\$ I think the initial value of x could just be 'L' for -2! \$\endgroup\$
– Dom Hastings
Commented Nov 20, 2023 at 14:16

Add a comment |

pacman256 · Accepted Answer · 2023-11-29 14:00:01Z

1

Vyxal 3, 7 bytes

'L{§ᶴol

Try it Online!

Lolololololol

answered Nov 29, 2023 at 14:00

pacman256

4,7181 gold badge9 silver badges32 bronze badges

Add a comment |

Lolololololololololololol

Task

136 Answers 136

Acc!!, 48 42 bytes

?Q?, 10 bytes

explained

Splinter, 11 bytes

Barrel, 8 bytes

Lua, 31 bytes

GForth 30 bytes

Batch (30 Bytes)

Haskell, 25 bytes

Z80Golf, 9 bytes

Explanation

BrainCrash, 43 22 bytes.

Gaia, 9 bytes

JavaScript (Node.js), 49 bytes

Pyth, 8 bytes

Etch, 23 bytes

Befunge-98 (PyFunge), 15 12 11 bytes

Rust, 41 bytes

PHP (25 chars)

Clojure, 24 bytes

Rust, 41 bytes

Alice, 10 bytes

Explanation

Thunno, \$ 8 \log_{256}(96) \approx \$ 6.58 bytes

Explanation

Binary-encoded Golifcal, 13 bytes

Fortran (GFortran) --cpp, 57 bytes

Nibbles, 5 bytes (10 nibbles)

Python, 45 Bytes

SAS, 42 bytes

Byte-based instruction jumping, 8 bytes

Basic, 20 bytes

JavaScript (Node.js), 41 bytes

Vyxal 3, 7 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfstringsequence or ask your own question.

Linked

Related

Hot Network Questions

Acc!!, ⁴⁸ 42 bytes

Fortran (GFortran) `--cpp`, 57 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
string
sequence
or ask your own question.