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 8, 2024 16:11Bubble BoiBubble BoiScore: 174,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2024 16:11174,3941,502,489,5251,447,469,99102,232,320
2Feb 8, 2024 16:11174,4311,505,087,2591,447,777,73502,252,800
3Feb 8, 2024 16:11174,5251,523,448,1301,448,553,77302,248,704