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 22, 2024 18:55MatthiasMatthiasScore: 1,826,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 18:551,824,74915,173,958,78415,080,439,00064,976,0002,265,088
2Nov 22, 2024 18:551,825,57615,183,356,59615,087,305,00064,975,0002,281,472
3Nov 22, 2024 18:551,825,58815,187,887,24115,086,403,00065,975,0002,277,376
4Nov 22, 2024 18:551,825,80215,183,280,39515,089,188,00064,970,0002,281,472
5Nov 22, 2024 18:551,826,51115,193,932,52115,100,073,00059,968,0002,289,664
6Nov 22, 2024 18:551,826,57915,194,653,47015,094,632,00065,972,0002,293,760
7Nov 22, 2024 18:551,826,84415,190,380,63315,094,833,00067,972,0002,281,472
8Nov 22, 2024 18:551,828,86915,212,005,24615,096,644,00082,965,0002,281,472
9Nov 22, 2024 18:551,868,87315,540,850,24615,436,676,00074,969,0002,265,088