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 8, 2024 07:20matsuoka-601matsuoka-601Score: 84,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2024 07:2084,457726,918,063698,996,0001,999,0002,293,760
2Oct 8, 2024 07:2184,469724,817,479699,089,0002,000,0002,293,760
3Oct 8, 2024 07:2184,487730,872,836700,246,0001,000,0002,293,760
4Oct 8, 2024 07:2084,504730,918,783700,384,000999,0002,293,760
5Oct 8, 2024 07:2084,558729,358,522699,833,0001,999,0002,498,560
6Oct 8, 2024 07:2184,574723,566,250700,963,000999,0002,494,464