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:08metalcoffeemetalcoffeeScore: 508,396Success
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:08508,2244,268,293,3584,218,261,11402,252,800
2Dec 11, 2023 21:07508,3504,293,803,6684,219,304,38802,236,416
3Dec 11, 2023 21:07508,3574,272,307,7774,219,366,04002,240,512
4Dec 11, 2023 21:07508,3964,280,593,4004,219,689,03402,236,416
5Dec 11, 2023 21:08509,3434,294,427,6044,227,548,26502,232,320
6Dec 11, 2023 21:08514,2904,338,934,5534,268,607,83102,232,320