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:12Bubble BoiBubble BoiScore: 64,983Success
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:1264,893601,411,588538,613,58102,256,896
2Feb 2, 2024 17:1264,983603,935,842539,361,85502,236,416
3Feb 2, 2024 17:1265,000599,804,186539,501,32902,240,512