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 20, 2024 02:01zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 02:0000000Error: Killed by timeoutstderr
2Nov 20, 2024 02:013,51951,995,43527,192,0002,014,0002,527,232
3Nov 20, 2024 02:013,53253,679,64629,317,00002,392,064
4Nov 20, 2024 02:013,54549,662,88128,407,0001,014,0002,383,872
5Nov 20, 2024 02:013,71756,193,05129,860,000995,0002,531,328
6Nov 20, 2024 02:013,71959,973,54329,870,000995,0002,531,328
7Nov 20, 2024 02:013,72853,333,64228,948,0001,996,0002,392,064