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 listNov 11, 2024 05:32NoSIMD_C#NoSIMD_C#Score: 362,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 05:32360,7833,025,252,7142,899,582,00094,920,0002,355,200
2Nov 11, 2024 05:32362,3793,036,592,4932,892,830,000114,913,0002,502,656
3Nov 11, 2024 05:32362,4253,043,580,7562,906,190,000101,936,0002,355,200