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

  • SEARCH
  • Home
  • 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 8909713
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T03:30:08+00:00 2026-06-15T03:30:08+00:00

Is there fast and simple way to make an % operation for 64bit integer

  • 0

Is there fast and simple way to make an “%” operation for 64bit integer given as “string” (for example “1bed658e4cbba3a7”)?

I know that Google Closure Library has such function, but I’d prefer not to use any external libraries, and moreover internally it works as three operations (division, multiplication and substraction) and seems to be not optimal.

Added:
Problem is that JavaScript cannot handle 64bit integers without loosing precision. For details see this question

  • 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-06-15T03:30:09+00:00Added an answer on June 15, 2026 at 3:30 am

    If you have an upper bound on the right-hand operand, then you can split the 64-bit int into two parts, and calculate the modulus from that. (It’s three % operations, and I don’t know whether that’s fast enough for your purposes).

    For example, if you want to calculate x % c, and c < 2^32, then you can split x into two parts, a and b, and calculate:

    (a * 2^32 + b) % c = (((a % c)* (2^32 % c)) + b) % c
    

    This depends on c being small, though. If it is also close to 64 bits, then you will want to look for other methods.

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

Sidebar

Related Questions

Is there a fast, low-garbage way to do it? I can't just do simple
Is there any fast algorithm that allows to compare two files (for verification purpose)
Is there a fast/efficiency way to check if a table is empty? DECLARE @StartEndTimes
Is there a fast way to count the amount of successive null bytes starting
On this page , I see something interesting: Note that there is a fast-path
It seems that there are several really fast prime factorization algorithms around (one that
I need to check in some fast way if there is any text nodes
I need a simple way of checking how much ram and fast the CPU
OK, I am creating a node.js module that will be a simple and fast
Is there any fast implementation of cryptographically secure pseudorandom number generator (CSPRNG) for C#

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.