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 listAug 31, 2026 08:06Tomislav TunkovicTomislav TunkovicScore: 3,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 08:093,013107,919,29398,372,0001,080,00028,672
2Aug 31, 2026 08:093,013107,936,45998,368,0001,078,00028,672
3Aug 31, 2026 08:093,015108,098,52498,424,0001,094,00028,672
4Aug 31, 2026 08:093,035110,235,59699,135,0001,038,00028,672
5Aug 31, 2026 08:093,039108,763,69199,220,0001,089,00028,672
6Aug 31, 2026 08:093,047108,996,49599,559,0001,013,00028,672
7Aug 31, 2026 08:093,062109,459,766100,046,0001,030,00028,672
8Aug 31, 2026 08:093,738139,925,715122,338,0001,026,00028,672
9Aug 31, 2026 08:093,886143,979,904127,167,0001,100,00028,672