Scream very loudly

Question

Write a script that outputs A to stdout infinitely.

There should be no newlines or separators between the characters.

Standard loopholes apply.

This is code-golf. The shortest solution in each language wins.

Answer 1

Kotlin, 50 47 bytes

fun main(a:Array<String>){while(0<1)print("A")}

1.) Thanks to @Adam for pointing out the args naming

Answer 2

Octave / MATLAB, 21 20 bytes

1 byte off thanks to @Yelp!

while printf('A')end

Try it online!

Explanation

printf('A') prints 'A' to STDOUT and returns the number of printed characters, that is, 1. This number is used as condition for the while...end loop, which thus becomes an infinite loop.

Answer 3

Written in Ark, 8 bytes

{~ !A }~

Answer 4

Minim, 10 Bytes

$<65.C=-1.

With whitespace and comments:

$< 65.  ; Print 65 as unicode 'A'
C = -1. ; Set program counter to -1 (advances to 0 afterwards)

GitHub Repository

Answer 5

Swift, 35 bytes

while 1>0{print("A",terminator:"")}

Try It Online cuts it off after 128kiB of output, but this will run forever. Swift for loops are Python-like, not C-like, so those aren't any help here.

This is my first code golf for something other than Arduino.

Answer 6

Vim, 9 bytes

qqA<C-r>q<C-o>q<C-r>q

Uses the same Recursive Register Expansion trick as my Lolololololololololololol answer, inserting the unnamed register, which contains 'A' + the unnamed register. To see the output, you'll have to try it in Vim, and you may need to use Ctrl+C to stop the expansion if the terminal freezes.

Try it online!

Answer 7

Perl 5 (ppencode), 35 33 bytes

print uc chr ord qw s abs while x

Try it online!

Previous

print uc chr ord qw s abs while exp

Try it online!

Alternatively:

print uc chr ord qw s abs while cos

Answer 8

Lexurgy, 17 bytes

a propagate:
*=>A

Forever replaces an empty string with A.

Answer 9

Piet, 15 Codels:

Original(5x3):

Scaled (x20):

Operations in each loop:

push 8
dup
*
push 1
+
out(char) ;outputs 65 as 'A'

After each cycle, the index will flow through the white codel on the bottom left and repeat another cycle, running indefinitely.

Try it online!

Answer 10

Rust, 17 bytes

loop{print!("A")}

Try it online!

Not much of a golfing language, but I love the loop keyword.

Answer 11

Emmental, 20 bytes

;#58#46#35#63#!#65#?

Try it online!

How?

;#58#46#35#63#!#65#?
;                     push ';' onto the stack
 #58#46#35#63         push ":.#?" onto the stack
             #        push NULL onto the stack
              !       pop NULL, ":.#?", and ';', and make NULL mean ":.#?"
               #65    push 'A' onto the stack
                  #   push NULL onto the stack
                   ?  execute NULL

:.#?
:    duplicate 'A'
 .   pop and print 'A'
  #  push NULL onto stack
   ? execute NULL

Answer 12

Flobnar, 7 bytes

g,_@
1A

Try it online!

It is most space-efficient to grab A from code than to try to evaluate from single-digit numbers.

@       Evaluate to west
_       If the other side (west) is 0, evaluate to east:
,         Print as char and return 0:
g         Grab code at (1,1) which is 'A' (so A is printed)
1
_       The return value is 0, so evaluate to east,
        which is start of the program again (which also acts as <)
        so it is an infinite loop printing 'A' repeatedly

Answer 13

Nibbles, 2.5 bytes (5 nibbles)

^~"A"

^       # replicate
  "A"   # the letter "A" 
 ~      # infinitely

Answer 14

Trilangle, 4 bytes

This version has constant memory usage.

"A,o

Try it on the online interpreter!

Push an A, print it and pop it. For lack of an explicit exit instruction @, this loops infinitely by default.

Trilangle, 3 bytes

This version's memory usage grows without bound.

"Ao

Answer 15

><> (Fish), 4 bytes

5d*o

Try it

or

"A"o

Answer 16

dc, 9

[65Pdx]dx

Explanation

[     ]   # Push a macro to the stack
 65       # Push the number 65 to the stack
   P      # Pop and print ASCII char 65 (i.e. "A") with no newline
    d     # Duplicate the macro
     x    # Pop and execute the macro at the top-of-stack (tail recursion)
       d  # Duplicate the macro
        x # Pop and execute the macro at the top-of-stack

Try it online!

Answer 17

C++ (gcc), 49 bytes

#import<iostream>
int A(){for(;;)std::cout<<'A';}

Uses C++ I/O.

Try it online!

C++ (gcc), 41 bytes

#import<ios>
int A(){for(;;)printf("A");}

Uses C I/O.

Try it online!

Answer 18

VisiCalc, 3 bytes

You need an extra newline to enter the instruction. It's a modification of this solution.

/-A

The trailing newline is significant.

Explanation

/   Start a command:
 -  Replicate forever
  A The target for replication is the / character
Extra newline to enter the instruction

You end up with a cell with an infinite number of A's.
However, the current cell can only show a finite amount
of A's because cells are trunctuated based on their lengths.
```

Answer 19

MathGolf, 6 bytes

1É'Aq↑

Try it online.

Or

æ'A_q▲

Try it online.

Explanation:

1       # Push a 1
     ↑  # While true without popping,
 É      # using the following 3 commands:
  'A   '#  Push an "A"
    q   #  Pop and print it without trailing newline

     ▲  # Do while true with pop,
æ       # using the following 4 commands:
 'A    '#  Push an "A"
   _    #  Duplicate this "A"
    q   #  Pop and print it without trailing newline

Answer 20

Befunge-98 (FBBI), 3 bytes

'A,

Try it online!

' pushes the next character to the stack, , prints a char.

Answer 21

Julia 1.0, 17 bytes

f()=print('A')f()

Try it online!

Answer 22

Bash, 14 bytes

yes A|tr -cd A

will very quickly output A's.

Answer 23

Rust, 17 bytes

loop{print!("A")}

Try it online!

Answer 24

Lua, 27 bytes

while 1 do io.write("A")end

Try it online!

Answer 25

Red - 16 bytes

forever[prin 'A]

Answer 26

perl -l101 -E, 12 bytes

{print;redo}

Answer 27

4, 15 bytes

3.6006580050094

3. start of code

6 assigns to cell 00 the value 65

8 starts the loop, keeps running while cell 00 is not zero.

5 prints ASCII character of the cell 00

9 closes the loop

4 end of code

Answer 28

Kenbark-1 (first personal computer) 6/7 bytes

002:
024 X 
004 PC
234 200 Print A from X
343 004 jump back to begin of the program

Register X is on Address 002 (oct) Then we set program Counter (address 003) to 004 for starting code. Move value from X (024='A') to output register what is set of lights on device front (Address 200 oct). And unconditional jump back to address 004.

User will see steady light, but in reality computer still output A

I'm not sure how to count bytes since that 002: is needed to tell computer what part of memory we need to fill.

Try it by yourself: http://www.neocomputer.org/kenbak/kenbak1-JS.html

Answer 29

C# (Visual C# Interactive Compiler), 21 18 bytes

for(;;)Write('A');

Try it online!

Answer 30

JavaScript (Node.js), 33 32 bytes

for(;;)process.stdout.write('A')

Try it online!

-1 byte thanks to Maria Miller