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 10, 2026 12:54Pavel SkripkinPavel SkripkinScore: 67,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 12:5467,3342,254,694,9412,214,029,0007,996,0002,363,392
2Jan 10, 2026 12:5467,8952,266,274,4162,230,552,0009,993,0002,281,472
3Jan 10, 2026 12:5471,3002,383,034,0072,342,903,0009,991,0002,416,640