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 listDec 12, 2023 08:20Oleg KovalovOleg KovalovScore: 120,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2023 08:20119,7394,023,242,4663,951,389,01302,187,264
2Dec 12, 2023 08:20120,5674,043,141,9843,978,707,38102,203,648
3Dec 12, 2023 08:20122,6544,111,627,6474,047,587,56402,220,032