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 31, 2025 08:02Aman | अमनAman | अमनScore: 321,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:02321,22710,634,941,11810,561,511,00038,976,0002,326,528
2Dec 31, 2025 08:02321,45210,641,987,18510,567,937,00039,973,0002,506,752
3Dec 31, 2025 08:02324,77710,749,697,33910,684,649,00032,977,0002,527,232