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 10, 2024 20:48Joad NacerJoad NacerScore: 7,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:487,65288,045,53260,491,0003,024,0002,506,752
2Oct 10, 2024 20:487,66489,884,70461,594,0002,019,0002,334,720
3Oct 10, 2024 20:487,66989,229,69361,636,0002,020,0002,334,720