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 listDec 11, 2025 12:21Rajarshi BasuRajarshi BasuScore: 54,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 12:2153,5891,795,572,1801,757,441,00010,990,0002,482,176
2Dec 11, 2025 12:2154,1401,811,744,8791,774,616,00011,990,0002,318,336
3Dec 11, 2025 12:2157,6861,930,156,5161,893,639,0009,992,0002,420,736