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 listAug 22, 2023 07:15matsuoka-601matsuoka-601Score: 27,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2023 07:1525,437278,228,592211,123,29402,285,568
2Aug 22, 2023 07:1525,458273,271,728211,299,68302,277,376
3Aug 22, 2023 07:1525,466263,674,086211,371,41702,281,472
4Aug 22, 2023 07:1527,217254,354,112223,903,0001,999,0002,260,992
5Aug 22, 2023 07:1527,228251,049,708224,992,000999,0002,285,568
6Aug 22, 2023 07:1527,236249,010,164224,055,0002,000,0002,285,568
7Aug 22, 2023 07:1527,240247,256,028224,091,0002,000,0002,265,088
8Aug 22, 2023 07:1527,251257,881,032224,184,0002,001,0002,260,992
9Aug 22, 2023 07:1527,255251,110,786224,214,0002,001,0002,285,568
10Aug 22, 2023 07:1527,281250,312,665225,429,0001,001,0002,519,040
11Aug 22, 2023 07:1527,285254,311,020226,466,00002,285,568
12Aug 22, 2023 07:1527,287253,406,026226,479,00002,531,328