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 12, 2024 17:51Bubble BoiBubble BoiScore: 54,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2024 17:5154,642516,658,279453,531,76902,240,512
2Feb 12, 2024 17:5154,731509,078,351454,263,40402,244,608
3Feb 12, 2024 17:5154,807525,948,950454,896,77802,232,320