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 7, 2024 10:06Huy Duc LeHuy Duc LeScore: 53,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2024 10:0653,136497,853,738441,025,18202,256,896
2Feb 7, 2024 10:0653,141505,903,040441,072,21002,281,472
3Feb 7, 2024 10:0653,192505,614,570441,495,29202,293,760