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 5, 2026 07:46Павел РатмановПавел РатмановScore: 173,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 07:46162,3205,390,791,7895,331,588,00024,969,0002,285,568
2Jan 5, 2026 07:46173,0695,745,499,6955,686,305,00024,961,0002,285,568
3Jan 5, 2026 07:46173,6705,763,672,6255,702,139,00028,955,0002,392,064