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 18:08Павел РатмановПавел РатмановScore: 170,903Success
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 18:08169,9415,642,354,0465,576,067,00031,971,0002,285,568
2Jan 5, 2026 18:08170,9035,668,981,2115,604,842,00034,967,0002,285,568
3Jan 5, 2026 18:08172,9225,736,900,2625,669,455,00036,963,0002,277,376