Unique strings Sergey Svistunov

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 23, 2025 03:37Ian MckibbenIan MckibbenScore: 15,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 03:3715,111520,409,206432,703,00065,954,0002,318,336
2Jun 23, 2025 03:3715,143522,299,629424,756,00074,956,0002,301,952
3Jun 23, 2025 03:3715,159528,416,076429,361,00070,894,0002,359,296
4Jun 23, 2025 03:3715,213530,570,320434,030,00068,004,0002,301,952
5Jun 23, 2025 03:3715,220530,252,881427,363,00074,888,0002,363,392
6Jun 23, 2025 03:3715,235532,828,646417,806,00084,960,0002,306,048
7Jun 23, 2025 03:3715,258531,244,812434,579,00068,933,0002,383,872
8Jun 23, 2025 03:3715,281529,623,373418,388,00085,874,0002,310,144
9Jun 23, 2025 03:3715,330528,034,548413,907,00091,979,0002,301,952