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 6780029
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T16:27:27+00:00 2026-05-26T16:27:27+00:00

Strings are fixed length 8, contain alphanumeric characters and right-padded with spaces. I.e, STRING1

  • 0

Strings are fixed length 8, contain alphanumeric characters and right-padded with spaces.

I.e,

"STRING1 "
"STR2    "
"S       "

etc..

I was thinking memcmp might be the fastest here?

  • 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-26T16:27:28+00:00Added an answer on May 26, 2026 at 4:27 pm

    If you ensure that the strings are aligned on an 8-byte boundary via compiler-specific attributes, you can do:

    uint64_t a = *((uint64_t *) "STRING1 ");
    uint64_t b = *((uint64_t *) "STR2    ");
    

    Then a == b should yield to a single 64-bit instruction.

    Or, if they are just constant immutable strings (stored in a read-only area of the process), you can go on with comparing the const char * pointers themselves. It’s still a reliable test since a string literal that appears twice in the current translation unit should refer to the same memory:

    /* fails because the two strings are stored at different locations */
    "STRING1 " == "STR2    "
    /* should succeed, even the silliest compiler should merge both literals */
    "STRING1 " == "STRING1 "
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I wish to write a structure made up of fixed length strings to a
I have upgraded some VB6 code, which uses fixed length strings in custom types,
I need to create a structure or series of strings that are fixed lenght
I have a parsing system for fixed-length text records based on a layout table:
Arrays in java are fixed in length. Why does Java allow arrays of size
I want to generate a 24-bit-length hash from strings. After some googling, I found
I cannot get a string broken into fixed length chunks and added to an
I'm working in ANSI C with lots of fixed length arrays. Rather than setting
I am trying to format a string of arbitrary length into a fixed width
I am implementing a buffer of fixed length to read or write a string

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.