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 listJul 18, 2022 10:23RemyBRemyBScore: 66,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2022 10:1966,771611,118,055554,197,84202,195,456
2Jul 18, 2022 10:1566,794622,370,958554,389,05602,203,648
3Jul 18, 2022 10:2366,795631,727,478554,400,63302,195,456
4Jul 18, 2022 10:1966,796632,581,579554,403,04502,256,896
5Jul 18, 2022 10:1566,809646,417,797554,514,66102,191,360
6Jul 18, 2022 10:1566,814612,882,731554,556,88602,207,744
7Jul 18, 2022 10:2366,836620,916,001554,734,90402,195,456
8Jul 18, 2022 10:1966,869616,425,404555,013,43602,203,648
9Jul 18, 2022 10:2366,875620,156,386555,062,98402,203,648