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 18, 2024 07:36NoSIMD_C#NoSIMD_C#Score: 62,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2024 07:0962,000540,341,448464,637,00049,961,0002,547,712
2Dec 18, 2024 07:0962,033539,846,851457,885,00056,985,0002,535,424
3Dec 18, 2024 07:3662,061540,268,098453,091,00062,012,0002,531,328
4Dec 18, 2024 07:0962,074544,108,811466,196,00049,020,0002,338,816
5Dec 18, 2024 07:3662,167539,477,799459,990,00055,998,0002,535,424
6Dec 18, 2024 07:3662,393540,817,416456,880,00060,984,0002,453,504