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:32Bubble BoiBubble BoiScore: 453,749Success
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:32452,8863,824,081,9873,758,952,97602,236,416
2Feb 2, 2024 16:32453,7493,829,441,3353,766,120,34102,260,992
3Feb 2, 2024 16:32454,2073,825,037,6543,769,917,08302,248,704