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:47Yuriy LyfenkoYuriy LyfenkoScore: 7,350Success
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:477,16286,725,56557,433,0002,015,0002,400,256
2Sep 19, 2022 01:477,22081,244,24257,929,0001,997,0002,412,544
3Sep 19, 2022 01:477,29085,630,62155,467,0005,042,0002,338,816
4Sep 19, 2022 01:477,32786,298,43557,827,0002,991,0002,371,584
5Sep 19, 2022 01:477,34383,873,23958,951,0001,998,0002,482,176
6Sep 19, 2022 01:477,344122,960,33060,955,89502,195,456
7Sep 19, 2022 01:477,35091,314,52057,004,0004,000,0002,461,696
8Sep 19, 2022 01:477,38289,799,43954,240,0007,031,0002,342,912
9Sep 19, 2022 01:477,40084,278,70357,389,0004,027,0002,281,472
10Sep 19, 2022 01:477,419119,805,76961,575,24902,211,840
11Sep 19, 2022 01:477,45094,898,41858,845,0002,992,0002,351,104
12Sep 19, 2022 01:477,535140,065,64262,543,42902,252,800