Spontaneous Programming Competition - 1. A Minipc

Expected Deadline: 9.8. (Trixie Release) submissions after this may not be benchmarked

Origin

Assignment

maxValue
numCount
integer1
integer2
...

smallest
secondSmallest
...
secondBiggest
biggest

• All integers are encoded in decimal ASCII, with exactly one integer per line, in a POSIX text file format.
• The first 2 lines are special, all others must be sorted numerically.
• All integers from stdin must be in the output (excluding the first two of course)
• The first integer is the maximum integer to expect, all integers will be in range 0 (inclusive) and this integer (exclusive)
• The second integer is how many integers will follow after it (total line integer minus 2)
• All integers are 31-bit unsigned integers
• All Input and Output is passed to you as files, meaning you can use mmap for better IO performance. (Added after benchmark rewrite)
• There is no more than 1 billion of each integer
• There is no guarantee, that the range is densly filled, not all valid integers must exists
• There are usually more integers than the amount of integers contained in the whole range
• Duplicates must be output as duplicates

Example data

3
4
1
0
2
0

0
0
1
2

5 20 3 3 4 4 4 1 2 0 0 2 4 1 4 0 4 1 3 0 4 4

0 0 0 0 1 1 1 2 2 3 3 3 4 4 4 4 4 4 4 4

Submission

• via Email: jari.nestel@fau.de
• via Matrix: @pi04myre:fau.de

Submission Format

• Language: German or English
• Your Name / Text based identifier that sufficiently identifies you.
• 3 letter acronym to list in your benchmark.
• Readable code with comments.
• Optional: Shortened code for the characters challange. (must perform the same as the readable code)
• If your code needs to be build, you must provide a commandline to do so, you may also supply a Makefile for this purpose.
• You must provide a command line to be passed to `exec` for benchmarking.

• Your must be able to run in the FAU CIP environment.
• All benchmarks will enforce a conservative time limits.
• Your code must not interact with the file system, for the build this is okay.
• Current Benchmark System is: 32 GB RAM, Intel(R) Core(TM) i7-9700 CPU @ 3.00GHz

• the sufficiently small stderr output (Kilobytes preferably, Megabytes at max), or truncated if not
• a description of what the output lacks

• Your current preliminary time, without an extensive benchmark.
• Your current code size. Shebangs with their new line and a new line, do not count to the source code size.

Contestants

Honor Submissions (which are cool, but could not be benchmarked)

Benchmark

• Fastest Clean Code: Softly assigned to the fastest code, thats very easy to read.
• Fastest Live Solution: Fastest Solution at the Presence Event.
• Fastest Solution: Fastest Overall Solution.
• Least CPU Time Used: Smallest Amount of CPU Time used to sort everything.
• Most (Esoteric) Submissions: Most unique Submissions that are in different languages.
• Shortest Code: Least Characters used, excluding Shebang with its Newline and Newline at the End.
• Busiest Beaver: Longest Running (still benchmarkable) Code.
• Least Memory Used: Minimal Maximum Memory Usage

Results (as of now)

Waiting for Benchmark

Failing Benchmark

Result Table

Result Graphs

Code