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 20, 2022 16:43Bernard TeoBernard TeoScore: 30,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2022 16:5330,5471,072,010,1211,008,047,73202,195,456
2Aug 20, 2022 16:5330,6531,082,794,7021,011,550,35402,179,072
3Aug 20, 2022 16:4330,7461,084,779,6421,014,603,27002,236,416
4Aug 20, 2022 16:4330,8021,097,639,6861,016,452,66402,183,168
5Aug 20, 2022 16:4330,9521,086,238,2851,021,415,83602,191,360
6Aug 20, 2022 16:5331,1821,098,633,4221,029,005,10902,195,456