Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 895589
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T14:34:57+00:00 2026-05-15T14:34:57+00:00

What’s the fastest way to parse strings in C#? Currently I’m just using string

  • 0

What’s the fastest way to parse strings in C#?

Currently I’m just using string indexing (string[index]) and the code runs reasonably, but I can’t help but think that the continuous range checking that the index accessor does must be adding something.

So, I’m wondering what techniques I should consider to give it a boost. These are my initial thoughts/questions:

  1. Use methods like string.IndexOf() and IndexOfAny() to find characters of interest. Are these faster than manually scanning a string by string[index]?
  2. Use regex’s. Personally, I don’t like regex as I find them difficult to maintain, but are these likely to be faster than manually scanning the string?
  3. Use unsafe code and pointers. This would eliminate the index range checking but I’ve read that unsafe code wont run in untrusted environments. What exactly are the implications of this? Does this mean the whole assembly won’t load/run, or will only the code marked unsafe refuse to run? The library could potentially be used in a number of environments, so to be able to fall back to a slower but more compatible mode would be nice.
  4. What else might I consider?

NB: I should say, the strings I’m parsing could be reasonably large (say 30k) and in a custom format for which there is no standard .NET parser. Also, performance of this code is not super critical, so this partly just a theoretical question of curiosity.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T14:34:58+00:00Added an answer on May 15, 2026 at 2:34 pm

    30k is not what I would consider to be large. Before getting excited, I would profile. The indexer should be fine for the best balance of flexibility and safety.

    For example, to create a 128k string (and a separate array of the same size), fill it with junk (including the time to handle Random) and sum all the character code-points via the indexer takes… 3ms:

            var watch = Stopwatch.StartNew();
            char[] chars = new char[128 * 1024];
            Random rand = new Random(); // fill with junk
            for (int i = 0; i < chars.Length; i++) chars[i] =
                 (char) ((int) 'a' + rand.Next(26));
    
            int sum = 0;
            string s = new string(chars);
            int len = s.Length;
            for(int i = 0 ; i < len ; i++)
            {
                sum += (int) chars[i];
            }
            watch.Stop();
            Console.WriteLine(sum);
            Console.WriteLine(watch.ElapsedMilliseconds + "ms");
            Console.ReadLine();
    

    For files that are actually large, a reader approach should be used – StreamReader etc.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 435k
  • Answers 435k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Don't just use XML because it's XML. Use XML because:… May 15, 2026 at 3:40 pm
  • Editorial Team
    Editorial Team added an answer Calling std::vector<>::clear() does not necessarily free all allocated memory (it… May 15, 2026 at 3:40 pm
  • Editorial Team
    Editorial Team added an answer This would normally be handled with a link table for… May 15, 2026 at 3:40 pm

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.