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 listNov 9, 2024 23:36E SequeiraE SequeiraScore: 112,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2024 23:36111,3213,706,071,0093,659,602,00013,990,0002,449,408
2Nov 9, 2024 23:36112,6363,749,332,1183,703,994,00012,989,0002,281,472
3Nov 9, 2024 23:36114,9053,823,417,7233,776,897,00014,971,0002,281,472