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:37Yuriy LyfenkoYuriy LyfenkoScore: 7,388Success
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:377,26487,074,40457,275,0003,014,0002,301,952
2Sep 19, 2022 01:377,27182,680,30854,312,0006,034,0002,416,640
3Sep 19, 2022 01:377,27183,680,98556,325,0004,023,0002,273,280
4Sep 19, 2022 01:377,29485,273,16355,496,0005,045,0002,412,544
5Sep 19, 2022 01:377,33283,822,12356,865,0003,990,0002,330,624
6Sep 19, 2022 01:377,34079,866,01856,924,0003,994,0002,441,216
7Sep 19, 2022 01:377,38888,502,16756,293,0005,026,0002,449,408
8Sep 19, 2022 01:377,43388,084,70756,717,0004,975,0002,478,080
9Sep 19, 2022 01:377,48786,519,62259,133,0003,006,0002,510,848
10Sep 19, 2022 01:377,527127,444,71462,474,23402,195,456
11Sep 19, 2022 01:377,580130,214,18362,911,48202,281,472
12Sep 19, 2022 01:377,598142,870,89363,067,01202,199,552