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 15:21Bubble BoiBubble BoiScore: 54,757Success
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 15:2354,692523,233,437453,945,42602,228,224
2Feb 8, 2024 15:2354,717515,952,013454,155,04802,236,416
3Feb 8, 2024 15:2154,735527,126,727454,297,59502,248,704
4Feb 8, 2024 15:2354,757506,258,583454,482,75502,240,512
5Feb 8, 2024 15:2154,790519,107,040454,755,88002,240,512
6Feb 8, 2024 15:2154,844519,727,895455,206,07102,232,320