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 18:55Bubble BoiBubble BoiScore: 57,839Success
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 18:5557,718545,347,042479,061,34602,232,320
2Feb 2, 2024 18:5557,839536,532,890480,061,90902,240,512
3Feb 2, 2024 18:5557,846541,049,499480,118,89402,232,320