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 11, 2024 16:56Joad NacerJoad NacerScore: 4,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:564,40356,084,53635,530,0001,015,0002,297,856
2Oct 11, 2024 16:564,43661,744,73734,830,0001,990,0002,351,104
3Oct 11, 2024 16:564,43866,425,98234,847,0001,991,0002,535,424
4Oct 11, 2024 16:564,46157,289,46936,025,0001,000,0002,297,856
5Oct 11, 2024 16:564,47358,552,41036,127,0001,003,0002,531,328
6Oct 11, 2024 16:564,47958,264,20836,169,0001,004,0002,306,048