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 11:27Dmitrii 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 11:27392,5283,281,647,7183,196,000,00061,980,0002,461,696
2Sep 11, 2024 11:27392,9863,289,794,1943,195,827,00065,955,0002,453,504
3Sep 11, 2024 11:27393,1623,292,137,8043,196,280,00066,963,0002,523,136