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 listJan 7, 2026 01:28Josu San MartinJosu San MartinScore: 41,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 01:2841,5701,400,597,7161,221,060,000150,760,0002,445,312
2Jan 7, 2026 01:2841,9931,414,297,4161,222,031,000163,736,0002,289,664
3Jan 7, 2026 01:2842,5531,431,306,4911,260,428,000143,820,0002,445,312