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 5, 2022 15:25Yuriy LyfenkoYuriy LyfenkoScore: 8,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2022 15:258,25394,357,95166,487,0002,014,0002,387,968
2Dec 5, 2022 15:258,25799,670,50067,527,0001,007,0002,265,088
3Dec 5, 2022 15:258,30992,971,69264,968,0003,998,0002,359,296
4Dec 5, 2022 15:258,36197,772,81865,375,0004,023,0002,367,488
5Dec 5, 2022 15:258,37296,762,47365,459,0004,028,0002,412,544
6Dec 5, 2022 15:258,41095,856,26066,815,0002,991,0002,273,280
7Dec 5, 2022 15:258,43291,414,10864,984,0004,998,0002,318,336
8Dec 5, 2022 15:258,55498,435,63167,998,0002,999,0002,416,640
9Dec 5, 2022 15:258,628144,149,67371,608,74602,179,072
10Dec 5, 2022 15:258,702133,443,88272,226,18902,277,376
11Dec 5, 2022 15:258,702104,776,66270,222,0002,006,0002,490,368
12Dec 5, 2022 15:258,751138,756,10972,632,48602,260,992