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 10, 2024 21:43Bubble BoiBubble BoiScore: 54,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 21:4354,674517,020,716453,797,91902,244,608
2Feb 10, 2024 21:5154,688514,060,401453,908,09502,240,512
3Feb 10, 2024 21:5154,699524,039,714454,004,57902,240,512
4Feb 10, 2024 21:5154,709509,230,487454,081,97402,236,416
5Feb 10, 2024 21:5154,711521,972,893454,099,03002,240,512
6Feb 10, 2024 21:5154,760513,223,529454,504,02602,244,608
7Feb 10, 2024 21:4354,763519,066,290454,531,53302,228,224
8Feb 10, 2024 21:5154,816524,205,157454,971,60202,244,608
9Feb 10, 2024 21:4355,296527,131,241458,953,72902,232,320