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 15:53Dmitrii KravchenkoDmitrii KravchenkoScore: 66,189Success
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 15:5366,144577,344,145490,997,00057,999,000184,320
2Sep 11, 2024 15:5366,171578,939,627496,201,00053,021,0002,289,664
3Sep 11, 2024 15:5366,175572,789,743490,225,00059,027,000376,832
4Sep 11, 2024 15:5366,176572,839,196500,236,00049,023,000188,416
5Sep 11, 2024 15:5366,189573,820,293497,425,00051,940,0002,289,664
6Sep 11, 2024 15:5366,222579,800,545483,685,00065,957,0002,289,664
7Sep 11, 2024 15:5366,229578,469,636502,726,00046,974,0002,281,472
8Sep 11, 2024 15:5366,237573,151,800495,793,00053,977,0002,478,080
9Sep 11, 2024 15:5366,247572,798,420497,868,00051,986,0002,478,080