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 19:02Bubble BoiBubble BoiScore: 57,614Success
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 19:0257,310551,010,226475,675,50902,228,224
2Feb 2, 2024 19:0757,526555,830,342477,465,72502,236,416
3Feb 2, 2024 19:0757,539531,803,702477,572,54302,240,512
4Feb 2, 2024 19:0257,614535,184,102478,192,25702,236,416
5Feb 2, 2024 19:0757,628549,277,153478,315,39202,228,224
6Feb 2, 2024 19:0257,759536,492,652479,402,81102,240,512