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 listOct 8, 2023 20:05sliceteamsliceteamScore: 17,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2023 20:0517,474176,561,948143,036,0002,000,0002,387,968
2Oct 8, 2023 20:0517,562177,501,624143,768,0001,996,0002,523,136
3Oct 8, 2023 20:0517,563177,047,478143,775,0001,996,0002,387,968
4Oct 8, 2023 20:0517,580171,993,703143,918,0001,998,0002,260,992
5Oct 8, 2023 20:0517,584175,909,274143,947,0001,999,0002,392,064
6Oct 8, 2023 20:0517,684173,695,411145,779,000998,0002,375,680
7Oct 8, 2023 20:0517,702176,126,352145,928,000999,0002,260,992
8Oct 8, 2023 20:0517,706170,774,309144,957,0001,999,0002,260,992
9Oct 8, 2023 20:0517,771168,822,612146,500,0001,003,0002,260,992
10Oct 8, 2023 20:0517,929204,697,817148,809,13102,265,088
11Oct 8, 2023 20:0517,962215,015,109149,087,82702,269,184
12Oct 8, 2023 20:0517,978223,934,351149,217,99602,265,088