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 01:00Bubble BoiBubble BoiScore: 56,306Success
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 01:0056,189531,811,225466,365,70302,232,320
2Feb 16, 2024 01:0056,306534,356,887467,335,70302,232,320
3Feb 16, 2024 01:0056,758529,192,595471,090,84402,228,224