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 listFeb 16, 2024 00:58Bubble BoiBubble BoiScore: 50,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 00:5850,759479,036,145421,303,07002,236,416
2Feb 16, 2024 00:5850,795476,074,614421,599,98902,240,512
3Feb 16, 2024 00:5850,856487,168,517422,107,60502,240,512