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 7, 2024 12:47NoSIMD_C#NoSIMD_C#Score: 86,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 12:4786,842750,949,130656,810,00063,981,0002,297,856
2Nov 7, 2024 12:4786,936750,481,759656,611,00064,961,0002,293,760
3Nov 7, 2024 12:4788,634762,045,167681,685,00053,975,0002,301,952