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:55Bernard TeoBernard TeoScore: 30,459Success
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:3829,9301,052,412,165987,686,03002,187,264
2Aug 20, 2022 16:3830,1101,063,710,270993,639,58802,183,168
3Aug 20, 2022 16:3830,4381,076,769,0701,004,449,03302,187,264
4Aug 20, 2022 16:5530,4591,072,955,8331,005,161,09502,306,048
5Aug 20, 2022 16:5530,4771,077,680,1361,005,729,22402,195,456
6Aug 20, 2022 16:5530,6301,070,704,7001,010,779,27702,191,360