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 10, 2024 22:04Bubble BoiBubble BoiScore: 54,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 22:0454,720525,292,048454,175,03602,252,800
2Feb 10, 2024 22:0454,753512,298,870454,448,91502,236,416
3Feb 10, 2024 22:0454,768523,490,815454,571,21002,232,320