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 12, 2024 17:54Bubble BoiBubble BoiScore: 54,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2024 17:5454,697524,581,924453,989,13402,244,608
2Feb 12, 2024 17:5454,767517,451,814454,565,99802,240,512
3Feb 12, 2024 17:5454,880525,801,800455,507,47002,244,608