Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 27, 2022 18:05apuxbtapuxbtScore: 246,054Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 18:05244,5568,048,023,6632,029,812,94702,293,760
2Nov 27, 2022 18:05246,0549,011,380,1612,042,251,28802,306,048
3Nov 27, 2022 18:05246,3857,237,158,1862,044,995,90902,183,168