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 9, 2024 16:00virusegvirusegScore: 98,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 16:0098,782848,812,273761,895,00057,992,0002,293,760
2Dec 9, 2024 16:0098,815849,130,013764,152,00056,011,0002,318,336
3Dec 9, 2024 16:0098,868846,236,002764,635,00055,973,0002,289,664
4Dec 9, 2024 16:0098,958850,976,784760,397,00060,951,0002,514,944
5Dec 9, 2024 16:0098,963847,595,471750,449,00070,947,0002,314,240
6Dec 9, 2024 16:0098,992847,761,063760,661,00060,972,0002,297,856
7Dec 9, 2024 16:0099,028852,718,754765,936,00055,995,0002,289,664
8Dec 9, 2024 16:0099,170854,046,306762,101,00061,008,0002,535,424
9Dec 9, 2024 16:0099,359850,182,756762,704,00061,975,0002,301,952