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:30Bubble BoiBubble BoiScore: 77,266Success
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:3277,136704,812,565640,225,60602,228,224
2Feb 8, 2024 16:3277,179706,343,063640,583,36802,236,416
3Feb 8, 2024 16:3077,234701,819,175641,044,30402,236,416
4Feb 8, 2024 16:3277,266710,881,811641,305,03402,232,320
5Feb 8, 2024 16:3077,378692,787,268642,236,81102,224,128
6Feb 8, 2024 16:3078,202706,773,117649,077,68502,224,128