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 3, 2021 23:05Sergey SamokhvalovSergey SamokhvalovScore: 22,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 23:0522,453246,846,061186,361,29202,236,416
2Jul 3, 2021 23:0522,461230,165,025186,425,84202,252,800
3Jul 3, 2021 23:0522,598213,370,536187,561,00002,523,136
4Jul 3, 2021 23:0522,599216,743,874186,571,0001,003,0002,510,848
5Jul 3, 2021 23:0522,616217,804,898185,714,0001,996,0002,256,896
6Jul 3, 2021 23:0522,618210,768,862185,733,0001,997,0002,510,848
7Jul 3, 2021 23:0522,620216,686,627186,752,000998,0002,256,896
8Jul 3, 2021 23:0522,621213,959,312185,756,0001,997,0002,375,680
9Jul 3, 2021 23:0522,622213,921,750185,765,0001,997,0002,371,584
10Jul 3, 2021 23:0522,623216,126,074186,772,000998,0002,375,680
11Jul 3, 2021 23:0522,625212,713,385185,790,0001,997,0002,256,896
12Jul 3, 2021 23:0522,962233,991,742190,581,72702,236,416