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 06:56NoSIMD_C#NoSIMD_C#Score: 67,621Success
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 06:5667,561586,113,889502,784,00057,975,0002,289,664
2Dec 7, 2024 04:4867,563591,403,346500,800,00059,976,0002,535,424
3Dec 7, 2024 04:4867,565591,698,694503,808,00056,978,0002,535,424
4Dec 18, 2024 06:5667,621589,795,585498,228,00063,028,0002,347,008
5Dec 7, 2024 04:4867,644589,476,039502,400,00059,047,0002,535,424
6Dec 18, 2024 06:5667,663591,788,319498,649,00062,955,0002,531,328