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 11, 2024 13:58ivanivanScore: 64,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 13:5863,967554,800,743468,936,00061,991,0002,363,392
2Nov 11, 2024 13:5863,999554,178,576465,169,00066,024,0002,293,760
3Nov 11, 2024 13:5864,014552,394,913467,276,00064,037,0002,359,296
4Nov 11, 2024 13:5864,023565,190,510471,346,00060,044,0002,293,760
5Nov 11, 2024 13:5864,039555,496,279460,586,00070,936,0002,363,392
6Nov 11, 2024 13:5864,047561,080,767458,650,00072,944,0002,293,760
7Nov 11, 2024 13:5864,051558,157,837463,675,00067,952,0002,351,104
8Nov 11, 2024 13:5864,060565,299,041470,731,00060,965,0002,293,760
9Nov 11, 2024 13:5864,149560,647,379456,372,00076,062,0002,293,760