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 18, 2024 01:28zielajzielajScore: 3,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 01:283,77754,126,09431,352,00002,347,008
2Nov 18, 2024 01:283,78551,841,11031,415,00002,330,624
3Nov 18, 2024 01:283,78854,666,43731,443,00002,531,328
4Nov 18, 2024 01:283,79353,403,19629,454,0002,031,0002,514,944
5Nov 18, 2024 01:283,80258,610,51031,560,00002,531,328
6Nov 18, 2024 01:283,81554,649,47830,640,0001,021,0002,428,928