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 11, 2023 21:20metalcoffeemetalcoffeeScore: 508,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 21:20508,5054,268,225,0984,220,588,88802,252,800
2Dec 11, 2023 21:20508,9384,285,580,3524,224,182,55502,240,512
3Dec 11, 2023 21:20511,6114,303,179,2434,246,371,36402,232,320