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 listDec 6, 2023 02:26Yuriy LyfenkoYuriy LyfenkoScore: 7,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:267,18586,237,06258,626,0001,010,0002,310,144
2Dec 6, 2023 02:267,20886,209,17155,841,0003,988,0002,318,336
3Dec 6, 2023 02:267,24785,100,94357,143,0003,007,0002,502,656
4Dec 6, 2023 02:267,27383,473,41057,344,0003,018,0002,265,088
5Dec 6, 2023 02:267,27883,561,81157,385,0003,020,0002,453,504
6Dec 6, 2023 02:267,33086,031,28057,850,0002,992,0002,445,312
7Dec 6, 2023 02:267,33987,828,60756,923,0003,994,0002,441,216
8Dec 6, 2023 02:267,37686,102,66657,210,0004,014,0002,449,408
9Dec 6, 2023 02:267,40184,106,24857,404,0004,028,0002,367,488
10Dec 6, 2023 02:267,455131,572,55261,879,15402,285,568
11Dec 6, 2023 02:267,500118,987,29962,248,89502,228,224
12Dec 6, 2023 02:267,508123,139,08662,317,25702,187,264