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:25matsuoka-601matsuoka-601Score: 58,090Success
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:2558,017509,333,283478,544,0002,997,0002,510,848
2Oct 8, 2024 07:2558,090505,696,189480,149,0002,000,0002,494,464
3Oct 8, 2024 07:2558,112515,006,442481,326,0001,000,0002,293,760