Kattis

Tompkins Placement Contest

Welcome to Tompkins Placement Contest

This is the contest system for Tompkins Placement Contest. The contest has now finished. You can view the final results.

15
Problems

31 / 38
Contestants / Teams

47
Languages

89
Submissions

Description

This contest is designed to test whether one is qualified for the Advanced division of UIL Competitions.

We understand that not everyone can stay for the entire contest length. So promotion is based on the number of problems solved for the amount of time stayed. We will decide the cutoff as you leave.

Start & End Times

Start Time	2023-09-28 22:05 CEST
End time	2023-09-29 00:05 CEST

Problems

Label	Problem
A	Cut in Line
B	Luhn's Checksum Algorithm
C	Radio Commercials
D	Eight Queens
E	Treasure Hunt
F	Mumble Rap
G	Music Your Way
H	Closest Sums
I	Amsterdam Distance
J	Heimavinna
K	Vacuumba
L	Texture Analysis
M	Brýr
N	(More) Multiplication
O	Costume Contest

Scoring

Pass/Fail — Ranked

Explanation:
Each problem is pass/fail. Participants are ranked by the number of solved problems, breaking ties by penalty (sum of time + 20 minutes per wrong submission, for all solved problems). Time is rounded to minutes.

Standings

Standings are shown without limitation.

Languages

Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig

Kattis