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 14, 2024 00:04Joad NacerJoad NacerScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:045,21064,146,14441,228,0002,011,0002,297,856
2Oct 14, 2024 00:045,31662,834,27643,123,0001,002,0002,293,760
3Oct 14, 2024 00:045,40172,787,52943,835,000996,0002,297,856
4Oct 14, 2024 00:045,49975,077,39545,640,00002,297,856
5Oct 14, 2024 00:045,64171,470,86945,828,000996,0002,531,328
6Oct 14, 2024 00:045,76174,214,64546,819,000996,0002,531,328