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 2, 2024 17:42Bubble BoiBubble BoiScore: 63,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 17:4263,903582,617,873530,393,92602,240,512
2Feb 2, 2024 17:4263,967588,111,907530,929,54002,232,320
3Feb 2, 2024 17:4264,106602,176,090532,082,64302,228,224