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:01Dmitrii KravchenkoDmitrii KravchenkoScore: 77,243Success
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:0176,970661,149,396418,903,000219,949,0002,510,848
2Sep 11, 2024 15:0177,080666,395,180417,844,000221,917,0002,469,888
3Sep 11, 2024 15:0177,182664,132,487419,743,000220,865,0002,273,280
4Sep 11, 2024 15:0177,216666,277,296417,931,000222,963,0002,461,696
5Sep 11, 2024 15:0177,243668,903,096417,076,000224,040,0002,265,088
6Sep 11, 2024 15:0177,370670,933,642419,460,000222,713,0002,375,680
7Sep 11, 2024 15:0177,576671,133,560418,923,000224,958,0002,281,472
8Sep 11, 2024 15:0178,295677,923,491418,902,000230,945,0002,461,696
9Sep 11, 2024 15:0178,363674,598,695416,624,000233,789,0002,326,528