Why Does XOR Make a Difference in Performance?

Revision en1, by elnazar, 2025-01-08 00:22:45

Recently, I faced with one issue where two seemingly similar solutions performed differently. I want to know why it is happening?

Code 1: Used an XOR operation (num ^ some_randint) to preprocess numbers before counting their frequencies

Code 2: Counted numbers directly without any transformation.

Both codec followed identical logic after this step, but code 1 passed the test cases efficiently, while code 2 gotaTLE.

WHY? I would be happy if someone could explain.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English elnazar 2025-01-08 00:22:45 645 Initial revision for English translation
ru1 Russian elnazar 2025-01-08 00:22:10 645 Первая редакция (опубликовано)