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 listSep 26, 2023 07:41leeian1011leeian1011Score: 352,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2023 07:37351,3612,985,189,6582,916,293,03402,314,240
2Sep 26, 2023 07:37351,8282,979,300,9652,920,174,59002,187,264
3Sep 26, 2023 07:41352,3182,991,505,2392,924,242,29902,191,360
4Sep 26, 2023 07:41352,7912,998,516,2422,928,163,84502,191,360
5Sep 26, 2023 07:37353,3322,984,900,2532,932,654,86602,191,360
6Sep 26, 2023 07:41515,1384,339,527,2634,275,648,73202,187,264