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 08:35Dmitrii KravchenkoDmitrii KravchenkoScore: 392,986Success
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 08:35391,6933,278,728,1223,180,099,00070,957,0002,293,760
2Sep 11, 2024 08:35392,9863,289,200,5403,190,831,00070,951,0002,285,568
3Sep 11, 2024 08:35393,7023,295,660,8403,183,784,00083,941,0002,285,568