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 30, 2022 15:38Yuriy LyfenkoYuriy LyfenkoScore: 10,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:389,567103,130,46076,393,0003,015,0002,334,720
2Jul 30, 2022 15:389,575104,122,50575,452,0004,024,0002,486,272
3Jul 30, 2022 15:389,637106,359,74277,991,0001,999,0002,367,488
4Jul 30, 2022 15:389,750104,114,38076,928,0003,996,0002,490,368
5Jul 30, 2022 15:389,825112,217,47677,568,0003,977,0002,506,752
6Jul 30, 2022 15:389,864107,631,90979,873,0001,996,0002,445,312
7Jul 30, 2022 15:3810,000176,047,99182,997,03702,244,608
8Jul 30, 2022 15:3810,046150,284,06383,379,52102,220,032
9Jul 30, 2022 15:3810,084106,438,19880,709,0002,989,0002,461,696
10Jul 30, 2022 15:3810,694118,861,99883,772,0004,986,0002,289,664
11Jul 30, 2022 15:3810,825111,664,88085,856,0003,993,0002,371,584
12Jul 30, 2022 15:3814,630181,989,194121,428,69402,265,088