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 22, 2023 22:21Ignas BagdonasIgnas BagdonasScore: 12,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 22:2111,757125,042,60595,568,0002,011,0002,269,184
2Sep 22, 2023 22:2111,783125,697,12595,805,0001,995,0002,273,280
3Sep 22, 2023 22:2111,842120,737,78196,285,0002,005,0002,367,488
4Sep 22, 2023 22:2111,995126,959,16699,559,00002,273,280
5Sep 22, 2023 22:2112,000128,891,75598,597,0001,006,0002,273,280
6Sep 22, 2023 22:2112,014127,495,09597,722,0001,994,0002,269,184
7Sep 22, 2023 22:2112,020123,464,61497,769,0001,995,0002,260,992
8Sep 22, 2023 22:2112,026132,666,42897,819,0001,996,0002,273,280
9Sep 22, 2023 22:2112,027122,606,68596,827,0002,994,0002,277,376
10Sep 22, 2023 22:2112,449163,860,255103,326,56402,277,376
11Sep 22, 2023 22:2112,630167,085,722104,828,26002,297,856
12Sep 22, 2023 22:2112,659193,751,636105,068,61802,293,760