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 listJul 25, 2022 17:28Yuriy LyfenkoYuriy LyfenkoScore: 14,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 17:2814,579141,269,490119,002,0002,000,0002,412,544
2Jul 25, 2022 17:2814,597152,488,693117,154,0004,005,0002,379,776
3Jul 25, 2022 17:2814,598144,862,111120,162,0001,001,0002,314,240
4Jul 25, 2022 17:2814,602141,733,923119,192,0002,003,0002,301,952
5Jul 25, 2022 17:2814,608149,153,948119,241,0002,004,0002,306,048
6Jul 25, 2022 17:2814,608142,290,040118,240,0003,006,0002,351,104
7Jul 25, 2022 17:2814,636146,723,771118,466,0003,011,0002,506,752
8Jul 25, 2022 17:2814,714146,253,626119,124,0003,003,0002,355,200
9Jul 25, 2022 17:2815,012147,098,790122,610,0001,993,0002,367,488
10Jul 25, 2022 17:2815,099186,773,657125,320,89002,269,184
11Jul 25, 2022 17:2815,108195,664,882125,399,82402,252,800
12Jul 25, 2022 17:2815,120190,236,058125,492,47902,199,552