Cover Image for LavinMQ Code Summit
Cover Image for LavinMQ Code Summit
Avatar for LavinMQ
Presented by
LavinMQ
31 Went
Registration
Past Event
Welcome! To join the event, please register below.
About Event

The LavinMQ Code Summit is happening on June 3rd in Skellefteå, as part of Google's Hack with AI event, celebrating the launch of Google's new Sweden cloud region. Google and LavinMQ are teaming up to host the northernmost gathering of Sweden's largest live coding event, turning Skellefteå into a true tech hotspot. The event is free of charge and includes lunch, dinner, fika, and drinks at the after-party. Bring your classmates or coworkers and let’s make it a fun and inspiring day to share, learn, and connect over code. Whether you're a seasoned coder or just vibing with tech, you're welcome to join!

There will be three exciting challenges at this hackathon:

  • The green slope 1-day challenge:

    • A challenge open to anyone familiar with coding in general, where you can build a solution using LavinMQ. This challenge will be available to view and solve during the hackathon itself.

  • Gaming challenge:

    • A challenge centered around gaming and AI. The challenge will kick off with an online meeting on May 19th and will run for two weeks leading up to the event.

  • IoT challenge:

    • Build a smart system using drones, AI, IoT, and edge computing to monitor rooftop snow depth in real time. Think faster decisions, reduced risks, and far less manual work. More information will be released on May 19th.

Online kick-off meeting May 19 at 12am.

Schedule:

8:00 AM — Door open + registration

9:00 AM — Welcome keynote by Annika Viklund + breakfast

10:00 AM — Challenge starts

1:00 PM — Lunch

5:00 PM — Presentations

6:00 PM — After Party + presentation from Google

7.00 PM — Dinner and drinks

8:00 PM — award ceremony

8.30 PM — Drinks

9 PM — End


Stay tuned for more details and get ready to join the fun!

Location
Sara kulturhus
Kanalgatan 43b, 931 31 Skellefteå, Sweden
Conference room "BYN"
Avatar for LavinMQ
Presented by
LavinMQ
31 Went