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 13:58Dmitrii KravchenkoDmitrii KravchenkoScore: 1,826,337Success
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 13:581,825,30415,179,844,79715,078,053,00071,971,0002,281,472
2Sep 10, 2024 13:581,825,37415,186,293,41715,085,633,00064,968,0002,379,776
3Sep 10, 2024 13:581,825,46215,185,585,76315,076,366,00074,967,0002,281,472
4Sep 10, 2024 13:581,825,60015,180,793,93915,085,504,00066,975,0002,281,472
5Sep 10, 2024 13:581,826,33715,194,283,98415,086,636,00071,964,0002,519,040
6Sep 10, 2024 13:581,826,41115,188,528,05915,096,235,00062,975,0002,289,664
7Sep 10, 2024 13:581,827,35015,199,122,65815,090,032,00076,969,0002,281,472
8Sep 10, 2024 13:581,828,83015,209,642,39615,122,312,00056,978,0002,281,472
9Sep 10, 2024 13:581,830,49715,227,083,76115,120,161,00072,967,0002,523,136