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 18:26CodeReclaimersCodeReclaimersScore: 6,096Success
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 18:276,018208,782,745194,426,0004,185,0002,113,536
2Aug 1, 2026 18:276,031209,801,111194,688,0004,360,0002,113,536
3Aug 1, 2026 18:276,033209,296,852194,651,0004,451,0002,113,536
4Aug 1, 2026 18:276,058209,976,102195,538,0004,382,0002,113,536
5Aug 1, 2026 18:276,096211,582,211196,841,0004,336,0002,113,536
6Aug 1, 2026 18:276,187214,504,425199,755,0004,447,0002,113,536
7Aug 1, 2026 18:276,191214,401,882199,793,0004,516,0002,113,536
8Aug 1, 2026 18:276,244218,216,745201,496,0004,558,0002,113,536
9Aug 1, 2026 18:276,248216,361,962201,684,0004,514,0002,113,536