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 15:37ndbnndbnScore: 108,920Success
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 15:37108,850929,970,800901,460,0001,998,0002,478,080
2Nov 11, 2024 15:37108,884927,876,830901,740,0001,999,0002,482,176
3Nov 11, 2024 15:37108,913927,299,277902,978,000999,0002,281,472
4Nov 11, 2024 15:37108,914933,379,866902,984,000999,0002,482,176
5Nov 11, 2024 15:37108,920924,400,962903,032,0001,000,0002,281,472
6Nov 11, 2024 15:37108,924930,519,939903,069,0001,000,0002,281,472
7Nov 11, 2024 15:37108,926932,515,303903,089,0001,000,0002,478,080
8Nov 11, 2024 15:37108,934923,403,542902,154,0001,998,0002,486,272
9Nov 11, 2024 15:37108,968924,406,100902,433,0001,998,0002,281,472