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 15:50Rajarshi BasuRajarshi BasuScore: 33,896Success
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 15:5033,7351,142,749,4951,095,256,00017,987,0002,498,560
2Dec 11, 2025 15:5033,8961,148,175,0411,095,566,00022,990,0002,404,352
3Dec 11, 2025 15:5034,0951,151,227,3411,110,139,00014,988,0002,379,776