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 07:56Bernard TeoBernard TeoScore: 110,122Success
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 07:57108,9833,663,137,0863,596,452,49602,187,264
2Aug 20, 2022 07:57109,2413,662,278,4393,604,958,25902,187,264
3Aug 20, 2022 07:56109,6113,684,728,9763,617,147,14202,195,456
4Aug 20, 2022 07:59109,6563,686,467,1933,618,632,21802,187,264
5Aug 20, 2022 07:59110,1223,686,986,3483,634,013,08202,187,264
6Aug 20, 2022 07:59110,2133,694,832,0323,637,023,43902,187,264
7Aug 20, 2022 07:56110,5073,715,931,5373,646,744,14102,187,264
8Aug 20, 2022 07:57110,8943,732,108,9023,659,490,49102,187,264
9Aug 20, 2022 07:56111,1073,747,556,0263,666,529,30702,301,952