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 listMay 27, 2024 21:30Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 21:3100000Error: Exit with code 1: Segmentation fault at address: 1208025152stderr
2May 27, 2024 21:3300000Error: Exit with code 1: Segmentation fault at address: 2416181376stderr
3May 27, 2024 21:3400000Error: expected "53683112065347845 ", got "53683112973125647 "
4May 27, 2024 21:326,217119,798,47651,600,99202,191,360
5May 27, 2024 21:306,225114,817,95151,666,33802,220,032
6May 27, 2024 21:356,267118,071,90052,013,89802,207,744
7May 27, 2024 21:306,269108,789,81052,033,93302,215,936
8May 27, 2024 21:326,271120,494,53552,045,39002,183,168
9May 27, 2024 21:306,284118,417,50552,160,11402,203,648
10May 27, 2024 21:326,293112,103,50652,233,24602,203,648
11May 27, 2024 21:356,395104,847,20353,082,24702,207,744
12May 27, 2024 21:356,396108,850,98253,083,44702,187,264