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 4, 2024 03:32Bubble BoiBubble BoiScore: 56,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2024 03:3256,366541,559,296467,834,50402,232,320
2Feb 4, 2024 03:3256,432524,200,133468,386,88702,240,512
3Feb 4, 2024 03:3256,466528,968,666468,670,79502,252,800