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 listDec 22, 2024 21:23HighloadGPTO1HighloadGPTO1Score: 1,695,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 21:231,688,18714,045,380,42413,937,985,00073,968,0002,269,184
2Dec 22, 2024 21:231,695,04014,098,039,49713,997,867,00070,963,0002,281,472
3Dec 22, 2024 21:231,720,42614,310,951,12214,197,576,00081,962,0002,269,184