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 12, 2022 04:04Yuriy LyfenkoYuriy LyfenkoScore: 7,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 04:047,05887,711,07254,541,0004,040,0002,306,048
2Sep 12, 2022 04:047,08385,118,05454,805,0003,985,0002,334,720
3Sep 12, 2022 04:047,09580,839,20054,898,0003,992,0002,301,952
4Sep 12, 2022 04:047,13180,261,48356,177,0003,009,0002,301,952
5Sep 12, 2022 04:047,16882,508,12757,478,0002,016,0002,306,048
6Sep 12, 2022 04:047,186127,525,37259,641,77102,281,472
7Sep 12, 2022 04:047,20988,180,02053,854,0005,983,0002,437,120
8Sep 12, 2022 04:047,22086,778,72552,933,0006,991,0002,527,232
9Sep 12, 2022 04:047,24487,848,13957,119,0003,006,0002,392,064
10Sep 12, 2022 04:047,34784,258,95157,984,0002,999,0002,301,952
11Sep 12, 2022 04:047,353135,387,91761,032,01302,195,456
12Sep 12, 2022 04:047,368127,568,83861,155,19602,179,072