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 16:18Bubble BoiBubble BoiScore: 452,756Success
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 16:18452,6563,815,566,3713,757,041,35102,248,704
2Feb 2, 2024 16:18452,7563,827,421,3013,757,871,22602,252,800
3Feb 2, 2024 16:18456,8253,863,884,5973,791,647,47702,232,320