Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 18, 2026 16:58Victor MerckléVictor MerckléScore: 3,197Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:593,16695,001,255246,060,0001,030,0002,162,688
2Jun 18, 2026 16:593,17995,387,182245,599,0002,041,0002,162,688
3Jun 18, 2026 16:593,18195,458,505249,655,00002,162,688
4Jun 18, 2026 16:593,19295,774,112249,588,0001,007,0002,162,688
5Jun 18, 2026 16:593,19795,923,367248,668,0001,008,0002,162,688
6Jun 18, 2026 16:593,20196,036,515250,511,00002,162,688
7Jun 18, 2026 16:593,20696,192,350249,229,0002,056,0002,162,688
8Jun 18, 2026 16:593,24597,358,547254,236,00002,162,688
9Jun 18, 2026 16:593,25097,517,016253,643,0001,011,0002,162,688