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 listOct 30, 2021 14:38Mikhail ShirokovMikhail ShirokovScore: 145,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2021 14:38145,0874,845,208,0374,787,868,19702,273,280
2Oct 30, 2021 14:38145,6594,877,928,7704,806,739,34002,285,568
3Oct 30, 2021 14:38145,7544,871,715,5174,809,869,31702,310,144