Skip to content

feat: Solving day 22 #26

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 3, 2025
Merged

feat: Solving day 22 #26

merged 1 commit into from
Jan 3, 2025

Conversation

truggeri
Copy link
Owner

@truggeri truggeri commented Jan 3, 2025

Summary

This is a pretty straight forward solution. The only wrinkles I've added are to use bitwise arithmetic to hopefully speed up calculations.

Operation Bitwise
Multiply Shift left
Divide Shift right
Modulo AND with bit mask

@truggeri truggeri self-assigned this Jan 3, 2025
@truggeri truggeri merged commit 566ce90 into main Jan 3, 2025
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant