--- title: "Contest Dupe Program" type: "article" slug: "contest-dupe-program" url: "http://localhost/article/contest-dupe-program/" markdown_url: "http://localhost/article/contest-dupe-program.md" published_at: "2026-01-15T14:46:45+00:00" modified_at: "2026-01-15T14:46:45+00:00" featured_image: url: "http://localhost/wp-content/uploads/2022/04/20230809-041332.jpg" excerpt: "Here's another contest dupe program, useful for eliminating duplicate contest contacts. It requires 16K duplicate and holds 1600 calls. The band variable (B$) should be two characters. The program prints the calls by call areas for each band, but does not sort the calls. Hank used a modified version of KQ2F's Roster Program (Apr QZX)…" category: - name: "QZX" slug: "qzx" taxonomy: "category" url: "http://localhost/category/periodicals/qzx/" post_tag: - name: "TS 1000" slug: "ts1000" taxonomy: "post_tag" url: "http://localhost/tag/ts1000/" - name: "Type-in program" slug: "type-in-program" taxonomy: "post_tag" url: "http://localhost/tag/type-in-program/" model: - name: "Timex/Sinclair 1000" slug: "ts-1000" taxonomy: "model" url: "http://localhost/model/ts-1000/" indiv: - name: "Hank Kohl (K8DD)" slug: "hank-kohl-k8dd" taxonomy: "indiv" url: "http://localhost/indiv/hank-kohl-k8dd/" publication_r: id: 21219 title: "QZX" type: "periodical" url: "http://localhost/periodical/qzx/" authors_r: - name: "Hank Kohl (K8DD)" slug: "hank-kohl-k8dd" taxonomy: "indiv" url: "http://localhost/indiv/hank-kohl-k8dd/" volume: "1" issue: "11" issues_articles: - id: 62166 title: "QZX v1 n11" type: "issue" url: "http://localhost/issue/qzx-v1-n11/" pages: "5-6" pubdate: "October 1983" archive_link: false --- # Contest Dupe Program Here’s another contest dupe program, useful for eliminating duplicate contest contacts. It requires 16K duplicate and holds 1600 calls. The band variable (B$) should be two characters. The program prints the calls by call areas for each band, but does not sort the calls. Hank used a modified version of KQ2F’s Roster Program (Apr QZX) to sort. He has hopes of converting it to machine code to speed it up. I bet Bob Berch’s compiler would do the trick!