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 18, 2024 01:58zielajzielajScore: 4,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 01:583,55049,141,55229,462,00002,514,944
2Nov 18, 2024 01:583,60054,150,29728,884,000996,0002,523,136
3Nov 18, 2024 01:583,75053,084,66829,121,0002,008,0002,523,136
4Nov 18, 2024 01:584,00059,190,92332,193,0001,006,0002,531,328
5Nov 18, 2024 01:584,02758,706,46533,421,00002,531,328
6Nov 18, 2024 01:584,04357,532,73633,556,00002,531,328