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 listNov 21, 2024 16:43KrishanKrishanScore: 57,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2024 16:4357,530507,340,940476,500,0001,001,0002,293,760
2Nov 21, 2024 16:4357,544507,601,556475,617,0001,998,0002,293,760
3Nov 21, 2024 16:4357,544504,274,000476,617,000999,0002,293,760
4Nov 21, 2024 16:4357,583501,905,243475,942,0001,999,0002,367,488
5Nov 21, 2024 16:4357,632500,935,718477,344,0001,000,0002,293,760
6Nov 21, 2024 16:4357,675510,587,891477,703,000999,0002,293,760
7Nov 21, 2024 16:4357,700504,156,250476,913,0001,999,0002,293,760
8Nov 21, 2024 16:4357,706504,122,247477,963,000999,0002,371,584
9Nov 21, 2024 16:4357,820513,649,496478,908,000999,0002,293,760