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 listSep 11, 2024 20:41Dmitrii KravchenkoDmitrii KravchenkoScore: 96,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 16:4595,590816,800,365569,568,000223,830,0002,453,504
2Sep 11, 2024 16:4596,140821,966,356570,258,000227,703,0002,453,504
3Sep 11, 2024 20:4196,715829,056,008571,811,000230,923,0002,453,504
4Sep 11, 2024 16:4596,828830,457,957573,051,000230,618,0002,355,200
5Sep 11, 2024 20:4199,237855,789,814589,050,000234,621,0002,330,624
6Sep 11, 2024 20:41100,3571,056,367,414586,083,000246,877,0002,387,968