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 listOct 9, 2024 17:54JosephJosephScore: 265,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 17:54264,9882,225,445,8242,100,426,00098,972,0002,310,144
2Oct 9, 2024 17:54264,9952,235,677,7962,107,479,00091,977,0002,482,176
3Oct 9, 2024 17:54265,0462,234,369,3002,116,926,00082,957,0002,490,368
4Oct 9, 2024 17:54265,0822,222,000,2882,127,206,00072,972,0002,326,528
5Oct 9, 2024 17:54265,1662,226,082,9792,097,932,000102,947,0002,326,528
6Oct 9, 2024 17:54265,1812,224,699,8162,108,044,00092,957,0002,326,528
7Oct 9, 2024 17:54265,1892,223,375,3292,107,106,00093,960,0002,490,368
8Oct 9, 2024 17:54265,2692,232,034,8882,109,787,00091,947,0002,326,528
9Oct 9, 2024 17:54265,9442,234,519,2332,114,364,00092,972,0002,326,528