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 10, 2024 22:11Dmitrii KravchenkoDmitrii KravchenkoScore: 485,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2024 22:11482,6784,041,004,0493,920,306,00085,919,0002,293,760
2Sep 10, 2024 22:11485,8874,058,340,7623,960,898,00071,961,0002,289,664
3Sep 10, 2024 22:11486,5024,066,518,4583,973,999,00063,967,0002,281,472