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 8, 2024 15:12Bubble BoiBubble BoiScore: 54,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2024 15:1254,699515,242,334453,998,73002,232,320
2Feb 8, 2024 15:1254,793510,259,132454,778,57502,236,416
3Feb 8, 2024 15:1254,823537,252,134455,031,79802,240,512