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 listJun 22, 2025 16:26Ian MckibbenIan MckibbenScore: 22,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:2622,515765,860,793617,009,000126,001,0002,297,856
2Jun 22, 2025 16:2622,567768,790,550619,753,000124,950,0002,342,912
3Jun 22, 2025 16:2622,832782,006,535626,545,000126,908,0002,347,008