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:50Dmitrii KravchenkoDmitrii KravchenkoScore: 68,164Success
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:5068,100592,149,718502,205,00063,025,000417,792
2Sep 11, 2024 15:5068,132594,525,918499,440,00066,058,000184,320
3Sep 11, 2024 15:5068,147589,029,957498,667,00066,955,000425,984
4Sep 11, 2024 15:5068,150587,752,617509,680,00055,964,000188,416
5Sep 11, 2024 15:5068,164590,648,233491,790,00073,968,000188,416
6Sep 11, 2024 15:5068,302590,474,540500,920,00065,989,000172,032
7Sep 11, 2024 15:5068,315594,242,714498,014,00069,001,0002,289,664
8Sep 11, 2024 15:5068,353594,416,616499,294,00068,040,0002,289,664
9Sep 11, 2024 15:5068,355595,627,637494,305,00073,045,0002,289,664