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 05:41Ian MckibbenIan MckibbenScore: 20,715Success
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 05:4120,665705,898,201610,943,00070,993,0002,359,296
2Jun 22, 2025 05:4120,715707,926,276604,629,00078,951,0002,351,104
3Jun 22, 2025 05:4120,788713,243,999604,017,00082,002,0002,379,776