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 listAug 1, 2026 15:47CodeReclaimersCodeReclaimersScore: 6,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 15:486,288218,437,752203,277,0004,257,0002,113,536
2Aug 1, 2026 15:486,296218,037,005203,329,0004,439,0002,113,536
3Aug 1, 2026 15:486,298217,999,345203,617,0004,248,0002,113,536
4Aug 1, 2026 15:486,300218,851,722203,708,0004,219,0002,113,536
5Aug 1, 2026 15:486,303218,106,893203,717,0004,303,0002,113,536
6Aug 1, 2026 15:486,315219,260,546204,030,0004,389,0002,113,536
7Aug 1, 2026 15:486,322218,780,247204,204,0004,432,0002,113,536
8Aug 1, 2026 15:486,423222,210,885207,491,0004,497,0002,113,536
9Aug 1, 2026 15:486,472223,749,858209,064,0004,535,0002,113,536