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 19:53CodeReclaimersCodeReclaimersScore: 5,575Success
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 19:545,551193,535,732178,963,0004,237,0002,113,536
2Aug 1, 2026 19:545,552193,703,239178,859,0004,374,0002,113,536
3Aug 1, 2026 19:545,554193,458,332178,941,0004,364,0002,113,536
4Aug 1, 2026 19:545,560194,226,540179,251,0004,233,0002,113,536
5Aug 1, 2026 19:545,575194,032,782179,634,0004,348,0002,113,536
6Aug 1, 2026 19:545,585195,171,817179,913,0004,410,0002,113,536
7Aug 1, 2026 19:545,610195,203,065180,756,0004,400,0002,113,536
8Aug 1, 2026 19:545,758201,471,159185,506,0004,539,0002,113,536
9Aug 1, 2026 19:545,806202,596,762187,046,0004,575,0002,113,536