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:32ivanivanScore: 69,132Success
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:3269,014595,373,291514,838,00057,981,0002,285,568
2Nov 11, 2024 13:3269,059604,838,309503,166,00070,023,0002,375,680
3Nov 11, 2024 13:3269,089599,567,348497,514,00075,925,0002,285,568
4Nov 11, 2024 13:3269,112600,630,200507,674,00065,957,0002,371,584
5Nov 11, 2024 13:3269,132601,351,651508,817,00064,976,0002,293,760
6Nov 11, 2024 13:3269,161606,285,676520,034,00054,003,0002,371,584
7Nov 11, 2024 13:3269,179598,903,292496,159,00078,025,0002,293,760
8Nov 11, 2024 13:3269,194602,266,397503,269,00071,038,0002,457,600
9Nov 11, 2024 13:3269,209604,682,547505,385,00069,052,0002,371,584