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 2, 2024 17:41Bubble BoiBubble BoiScore: 63,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 17:4163,768597,456,648529,275,57902,236,416
2Feb 2, 2024 17:5663,860583,714,382530,038,21202,236,416
3Feb 2, 2024 17:5663,904590,685,996530,399,39902,232,320
4Feb 2, 2024 17:4163,905588,760,530530,415,20102,236,416
5Feb 2, 2024 17:4163,937602,738,862530,676,52202,252,800
6Feb 2, 2024 17:5664,095598,723,330531,989,26202,240,512