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 5, 2025 11:06CadovvlCadovvlScore: 41,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 11:0641,2801,384,892,7911,314,263,00047,973,0002,519,040
2Dec 5, 2025 11:0641,4161,392,507,6991,321,730,00044,990,0002,424,832
3Dec 5, 2025 11:0641,5471,401,610,2341,323,100,00047,967,0002,277,376
4Dec 5, 2025 11:0641,6341,404,855,9161,329,963,00043,965,0002,265,088
5Dec 5, 2025 11:0641,6421,402,283,8341,331,206,00042,974,0002,519,040
6Dec 5, 2025 11:0641,8121,405,860,7391,334,828,00044,960,0002,277,376
7Dec 5, 2025 11:0641,8881,409,086,0071,340,310,00041,978,0002,396,160
8Dec 5, 2025 11:0642,0001,416,064,9061,338,043,00047,965,0002,408,448
9Dec 5, 2025 11:0642,0731,414,999,9251,341,434,00046,980,0002,265,088