Considere um fluxo / arquivo com um número inteiro por linha. Por exemplo:

123
5
99

Seu código deve gerar a soma desses números, ou seja 227.

O formato de entrada é estritamente um número inteiro por linha. Você não pode, por exemplo, supor que a entrada esteja em uma linha como uma matriz de números inteiros.

Você pode receber entradas do STDIN, na forma de um nome de arquivo ou de um arquivo com o nome de sua escolha; você pode escolher qual. Nenhuma outra maneira de obter entrada é permitida.

A entrada conterá pelo menos um número inteiro. Você pode assumir que todos os números inteiros não são negativos e que a soma total é menor que .232

05AB1E , 2 bytes

|O

Explicação:

|   Get input as array
 O  Sum

Experimente online!

Bash + coreutils, 16 bytes

xargs|tr \  +|bc

Experimente online!

Existem dois espaços após o \. Isso funciona para números negativos também.

Explicação:

xargs             # known trick to turn newlines into spaces, while adding a
                  #trailing newline when printing the result (needed for bc)
|tr \  +          # turn spaces into '+'s
|bc               # calculates the sum

Você pode se perguntar por que tr \\n +|bcnão é melhor, pois transforma novas linhas diretamente em '+' s. Bem, isso tem 2 erros imprevistos:

• se a entrada tiver uma nova linha à direita, ela será convertida em um '+' à direita, portanto, não haverá número após a execução da adição
• e a questão mais estranha é que bc requer uma nova linha à direita após a entrada, mas você acabou de substituir todas as novas linhas de entrada por '+' s.

MATL , 2 bytes

Us

Isso espera a entrada em um arquivo de texto chamado defin.

Gif ou não aconteceu :

Ou experimente online! ( graças a Dennis pela instalação! )

Explicação

Quando um programa MATL é executado, se um arquivo chamado definfor encontrado (o nome se refere a "entrada padrão"), seu conteúdo é automaticamente carregado como texto e enviado para a pilha como uma string antes de executar o código.

A função Uavalia a string para convertê-la em um vetor de coluna de números e scalcula a soma, que é exibida implicitamente.

Japonês , 2 bytes

Nx

Explicação

     Implicit: parse STDIN into array of numbers, strings, and arrays
N    Get the resulting parsed array.
 x   Sum.
     Implicit: output result of last expression

Experimente online!

Colar + bc, 13 bytes

paste -sd+|bc

Explicação:

paste -s        Take one line at a time from input
        d+      Joining by '+'
          |bc   Pass as expression to bc

Outra resposta shell!

Perl 6 , 13 bytes

say sum lines

Tente

Explicação

• lines()retorna uma lista de linhas de $*INou $*ARGFILESum identificador de entrada de linha de comando "mágico".
• sum(…) was added to Perl 6 to allow [+] List to be optimized for Positionals that can calculate their sum without generating all of their values like 1..100000
  (I just thought sum was just too cute here to use [+] like I normally would)
• say(…) call the .gist method on its input, and prints it with an additional newline.

C, 53 bytes

r;main(i){for(;~scanf("%d",&i);r+=i);printf("%d",r);}

Python 3, 28 bytes

print(sum(map(int,open(0))))

Taken from this tip. I've been told this won't work on Windows.

Try it online!

Retina, 11 7 bytes

-4 thanks to Martin Ender

.*
$*
1

Try it online!

Convert to unary:

.*
$*

Count the number of 1s:

1

Brain-Flak, 20 bytes

(([]){[{}]{}([])}{})

Try it online!

Explanation

This is a golf off of a solution made by Riley in chat. His solution was:

([])({<{}>{}<([])>}{})

If your familiar with Brain-Flak this is pretty self-explanatory. It pushes the stack height and pops one value as it counts down, at the end it pushes the sum of all the runs.

It is a pretty good golf but he zeros both {} and ([]) however these will have a values that only differ by one so if instead we remove the masks and make one of the two negative they should nearly cancel out.

([])({[{}]{}([])}{})

Since they always differ by one we have the unfortunate circumstance where our answer is always off by the stack height. In order to remedy this we simply move the beginning of the push to encompass the first stack height.

(([]){[{}]{}([])}{})

Python 2, 40 bytes

import sys;print sum(map(int,sys.stdin))

R,11 bytes

sum(scan())

scan takes the input, one number per line. And sum, well, sums.

Perl 5, 9 bytes

8 bytes of code + -p flag.

$\+=$_}{

Try it online!

With -p, the input is read one line at a time, stored in $_ each time. We use $\ as accumulator, because thanks to -p flag, it's implicitly printed at the end. The unmatched }{ are used so -p flag only prints $\ once at the end instead of printing $_ and $\ at each line it reads like it normally does.

Pure Bash, 37 36 bytes

Thanks to @KevinCruijssen for a byte!

while read a;do((b+=a));done;echo $b

Try it online!

Haskell, 32 bytes

interact$show.sum.map read.lines

Try it online!.

interact collects the whole input from stdin, passes it to the function given as its argument and prints the string it gets back from this function. The function is:

            lines   -- split input into list of lines at nl
      map read      -- convert every line to a number (read is polymorphic,
                    -- but as want to sum it later, the type checker knows
                    -- it has to be numbers)
    sum             -- sum the list of numbers
show                -- convert back to string

PHP, 22 bytes

<?=array_sum(file(t));

This assumes there is a file named "t" with a list of integers.

file() opens a file and returns an array with each line stored a separate element in the array. array_sum() sums all the elements in an array.

Awk, 19 bytes

{s+=$1}END{print s}

Explanation:

{s+=$1}                For all lines in the input, add to s
        END             End loop
           {print s}    Print s

dc, 14 bytes

0[+?z2=a]dsaxp

Try it online!

Explanation:

 [      ] sa   # recursive macro stored in register a, does the following:
  +            # - sum both numbers on stack
               #   (prints to stderr 1st time since there's only 1)
   ?           # - read next line, push to stack as number
    z          # - push size of stack
     2         # - push 2
      =a       # - if stack size = 2, ? yielded something, so recurse
               # - otherwise end macro (implicit)
0              # push 0 (accumulator)
         d     # duplicate macro before storing it
            x  # Call macro
             p # The sum should be on the stack now, so print it

CJam, 5 bytes

q~]1b

Try it online!

How it works

q     e# Read all input from STDIN.
 ~    e# Evaluate that input, pushing several integers.
  ]   e# Wrap the entire stack in an array.
   1b e# Convert from base 1 to integer.
      e# :+ (reduce by sum) would work as well, but 1b handles empty arrays.

Python, 38 30 bytes

lambda n:sum(map(int,open(n)))

In python, files are opened by open('filename') (obviously). They are, however, iterables. Each time you iterate through the file, you get the next line. So map iterates over each list, calling int on it, and then sums the resulting list.

Call with the filename as input. (i.e. f('numbers.txt'))

8 bytes saved by using map(int, open(n)) instead of a list comprehension. Original code:

lambda n:sum([int(i)for i in open(n)]) 

Mathematica, 19 bytes

Assumes Mathematica's notebook environment.

Tr[#&@@@Import@"a"]

Expects the input to be in a file a.

Jelly, 9 8 bytes

ƈFпFỴVS

STDIN isn't really Jelly's thing...

Try it online!

How it works

ƈFпFỴVS  Main link. No arguments. Implicit argument: 0

  п      While loop; while the condition returns a truthy value, execute the body
          and set the return value to the result. Collect all results (including 0,
          the initial return value) in an array and return that array.
ƈ           Body: Yield a character from STDIN or [] if the input is exhausted.
 F          Condition: Flatten, mapping 0 to [], '0' to "0", and [] to [] (falsy).
    F     Flatten the result.
     Ỵ    Split at newlines.
      V   Evaluate the resulting strings.
       S  Take the sum.

Brachylog, 4 bytes

ṇịᵐ+

Try it online!

Explanation

ṇ         Split the Input on linebreaks
 ịᵐ       Map: String to Integer
   +      Sum

Pure bash, 30

read -d_ b
echo $[${b//'
'/+}]

Try it online.

• reads the input file in one go into the variable b. -d_ tells read that the line delimiter is _ instead of newline
• ${b//'newline'/+} replaces the newlines in b with +
• echo $[ ... ] arithmetically evaluates the resulting expression and outputs it.

Vim, 16 bytes/keystrokes

:%s/\n/+
C<C-r>=<C-r>"<C-h>

Since V is backwards compatible, you can Try it online!

Pyth, 3 bytes

s.Q

Try it online!

 .Q  Read all of standard input, evaluating each line.
s    Take the sum.

jq, 5 bytes

add, plus the command line flag -s.

For example:

% echo "1\n2\n3\n4\n5" | jq -s add
15

Actually, 2 bytes

kΣ

Try it online!

Explanation:

kΣ
    (implicit input - read each line, evaluate it, and push it to the stack)
k   pop all stack elements and push them as a list
 Σ  sum
    (implicit output)

dc, 22

[pq]sq0[?z2>q+lmx]dsmx

This seems rather longer than it should be, but it is tricky to decide when the end of the file is reached. The only way I can think of to do this is check the stack length after the ? command.

Try it online.

[pq]                    # macro to `p`rint top-of-stack, then `q`uit the program
    sq                  # save the above macro in the `q` register
      0                 # push `0` to the stack.  Each input number is added to this (stack accumulator)
       [         ]      # macro to:
        ?               # - read line of input
         z              # - push stack length to stack
          2             # - push 2 to the stack
           >q           # - if 2 > stack length then invoke macro stored in `q` register
             +          # - add input to stack accumulator
              lmx       # - load macro stored in `m` register and execute it
                  d     # duplicate macro
                   sm   # store in register `m`
                     x  # execute macro

Note the macro m is called recursively. Modern dc implements tail recursion for this sort of thing, so there should be no worries about overflowing the stack.

Pyke, 4 bytes

zbrs

Try it online!

z    -   input()
 b   -  int(^)
  r  - if no errors: goto start
   s - sum(stack)