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 19, 2022 01:46Yuriy LyfenkoYuriy LyfenkoScore: 7,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 01:467,18887,800,77357,641,0002,022,0002,437,120
2Sep 19, 2022 01:467,24882,084,08658,157,0002,005,0002,404,352
3Sep 19, 2022 01:467,28382,808,96956,417,0004,029,0002,347,008
4Sep 19, 2022 01:467,28984,888,28058,482,0002,016,0002,514,944
5Sep 19, 2022 01:467,29286,932,16456,492,0004,035,0002,392,064
6Sep 19, 2022 01:467,30388,221,85856,571,0004,040,0002,428,928
7Sep 19, 2022 01:467,37984,712,49558,237,0003,012,0002,527,232
8Sep 19, 2022 01:467,40886,900,17757,458,0004,032,0002,383,872
9Sep 19, 2022 01:467,445127,802,64261,791,01502,269,184
10Sep 19, 2022 01:467,44688,931,47956,816,0004,983,0002,359,296
11Sep 19, 2022 01:467,498123,483,65162,229,29602,256,896
12Sep 19, 2022 01:467,527128,146,23162,474,00902,199,552