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 25, 2024 14:51matsuoka-601matsuoka-601Score: 13,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 14:5113,441178,901,016111,556,84202,281,472
2Jul 25, 2024 14:5113,452178,248,341111,649,01102,293,760
3Jul 25, 2024 14:5113,453184,656,814111,663,67102,289,664
4Jul 25, 2024 14:5113,544133,652,636111,414,0001,003,0002,523,136
5Jul 25, 2024 14:5113,549134,480,069111,451,0001,004,0002,281,472
6Jul 25, 2024 14:5113,550133,820,140111,462,0001,004,0002,281,472
7Jul 25, 2024 14:5113,551139,003,899111,470,0001,004,0002,523,136
8Jul 25, 2024 14:5113,552134,253,707111,474,0001,004,0002,514,944
9Jul 25, 2024 14:5113,556146,775,134111,512,0001,004,0002,523,136
10Jul 25, 2024 14:5113,562136,544,122111,561,0001,005,0002,363,392
11Jul 25, 2024 14:5113,568140,871,297111,613,0001,005,0002,281,472
12Jul 25, 2024 14:5113,569142,648,962111,616,0001,005,0002,269,184