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 13, 2024 15:25Bubble BoiBubble BoiScore: 54,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2024 15:2554,717523,184,581454,151,12902,248,704
2Feb 13, 2024 15:4654,731509,665,073454,269,83502,236,416
3Feb 13, 2024 15:4654,783509,108,475454,696,87402,236,416
4Feb 13, 2024 15:4654,784511,306,893454,707,85302,236,416
5Feb 13, 2024 15:2554,816520,431,274454,970,90102,240,512
6Feb 13, 2024 15:2554,830509,567,273455,087,17102,244,608