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:38Dmitrii KravchenkoDmitrii KravchenkoScore: 74,066Success
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:3873,804638,009,672519,639,00092,935,0002,400,256
2Sep 11, 2024 15:3873,841634,704,385518,898,00093,981,0002,273,280
3Sep 11, 2024 15:3873,906643,951,561516,512,00096,908,0002,289,664
4Sep 11, 2024 15:3873,962637,116,565511,905,000101,981,0002,289,664
5Sep 11, 2024 15:3874,066644,945,334520,788,00093,961,0002,269,184
6Sep 11, 2024 15:3874,084639,221,241531,910,00082,986,0002,289,664
7Sep 11, 2024 15:3874,133636,954,341519,259,00096,048,0002,285,568
8Sep 11, 2024 15:3874,139643,505,851525,301,00090,051,0002,293,760
9Sep 11, 2024 15:3874,255641,515,111516,268,000100,052,0002,281,472