Advent of Code 2024
Hi Community,
The Season's holidays are fast approaching, and it's time to get ready for them! Join the Advent of Code 2024 with InterSystems and engage in our ObjectScript challenge!
.jpg)
🏆 Our Leaderboard 🏆
👉🏼 Join the ObjectScript private leaderboard with this code: 130669-ab1f69bf.
Note: You need to sign in to Advent of code (e.g. with GitHub / Google / X / Reddit account) to see the leaderboard and participate in the contest.
The winner will get 2000 Global Masters points to order his or her heart's desire and a high-level Global Masters badge.
All participants will also get a special Global Masters badge.
Win Conditions:
1. To win our prize, you should be on the top of the ObjectScript Leaderboard, upload all the solutions in a public repository on GitHub and present the code in InterSystems ObjectScript in UDL form as presented in the template below:
⬇️ The Advent of Code ObjectScript template
2. There should be no errors in the ObjectScript quality scanner for your project.
3. All participants have two days (December 26-27) to make their repositories public. The winner will be announced after December 28.
4. All participants must be registered on the InterSystems Developer Community.
The first puzzle will unlock on December 1st at midnight EST (UTC -5).
See you then, and good luck to all of you!
Comments
Go @Yuval Golan ❗
I knew I could trust you @Yuval Golan 👏
Similar to previous years I will provide the results of our private leaderboard
- It will sort by published ranking but separate DC members from "guests"
- The matching of DC members is a manual task
- if I missed you pls. let me know your identity in AoC by DC mail to add your DC flag
- due to private issue my updates might show delays sometimes
- 2 test sets with results are available on OEX: AoC2024-test or GitHub: AoC2024_test
- I just added a column to show completion of parts in the exercises
- - no part
- 1 only part 1 (silver star)
- 2 only part 2 (another silver star)
- 3 1+2 both parts completed (gold star)
DCrank AOCrank Scores Stars ok% ----- Code Parts OK ----- Name
0 --- ---- ---- --- ----*----*----*----*----* --- DC Members ---
177361501003333333333333333333333333 abdul-manaan
287296501003333333333333333333333333 Yuval Golan
39531036723333333333333331331------ JFerreB
41125981836333333333---------------- Peter Zubiago
51325371734333333331---------------- Oskari Kosonen
614205214283333313---1-------------- Keith Avery
715192813263333331------------------ Jani Hurskainen
81716391122333311--1---------------- Ivo ver eecke
918127891833331-------------------- TylerFeldhege
1021875612333---------------------- rhodery
1123695510331---------------------- Chris Marais
12245654833----------------------- Oliver Wilms
13 --- ---- ---- --- ------------------------- --- ISC internals ---
1427592501003333333333333333333333333 TestSet 11537545501003333333333333333333333333 TestSet 21622811612333---------------------- Junhee Lee
17 --- ---- ---- --- ------------------------- --- unknow in DC ---
1817683501003333333333333333333333333 Dominik Znidar
1947540501003333333333333333333333333 Joaquin Derrac Rus
2057539501003333333333333333333333333 Jarjar 3142167527501003333333333333333333333333 (anonymous user #1128565)
2210329523463333313-1331311---------- (anonymous user #4293990)
23122569183633333-331-1-3------------ Sloan Kanaski
24161902132633331111--1-------------- Chhayank Warad
251910838163333--------------------- Noah Dohrmann
262010648163333--------------------- (anonymous user #214666)
27254273631----------------------- Gary Nguyen
28 Rows(s) Affected
UTC 2024-12-3008:28:42
EST 2024-12-3003:28:42I just added a column to show completion of parts in the exercises
- - no part
- 1 only part 1 (silver star)
- 2 only part 2 (another silver star)
- 3 1+2 both parts completed (gold star)
The option 2 is redundant. Part 2 only unlocks when part 1 has been solved.
As an active participant you know the practical case.
Though most readers that never touched AOC might be confused.
The original intention was to exclude parts not solved in ObjectScript:
(e.g Java, C# JS, ....)
It turned out this was not possible to implement with acceptable effort.
I'm definitely and permanently fallen behind and used already most of my annual skill+time puzzle quota. So I'm not expecting to solve more than 7 or 8 first days. However you'll get a small story about my learnings here when I'm done ;)
Looking forward to hear your story!
That's often of much more value than the pure code..
Now available on your favorite internet community portal: My little Advent of Code 2024 journey!
Only 2 completed Packages from GitHub >
installed and verified with 2 test sets fulfill requirements.
You have to provide your test data set manually.
The contest is closed.
Thanks @Robert Cemper
Here is my Github repo: github.com/abdul-manaan/AOC24-ObjectScript
Happy Holidays!
Congratulations! I wonder how people did Day 24 Part 2 programmatically. I actually got my first ever global leaderboard star (#76) for this task, but I did it manually - rendered the network with GraphViz and looked for inconsistencies, fortunately got the correct answer on the first try.
I based my solution for 24.2 on the following equation (found by manually reading/understanding the input):
Equation:
zN = A ⊕. B
zN = [xN ⊕ yN]. ⊕. ( [xN−1∧yN−1] ∨ [input gates of zN−1 w/ AND])
In the input, for each zN, the equation defines the relationship A <OP> B = zN. If the operator <OP> is not XOR, this is incorrect. In such cases, zN needs to be swapped with tN, where tN can be derived using the property: A⊕B=tN.
Similarly, if the values A and B found using the above equation do not match the input gates of XOR for zN, this indicates an intermediate gate (either A or B) needs to be swapped to satisfy the conditions.