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 listJan 21, 2025 13:23Cameron AavikCameron AavikScore: 36,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 13:2336,4141,226,194,4861,150,662,00050,985,0002,547,712
2Jan 21, 2025 13:2336,5311,237,127,6051,152,542,00052,978,0002,371,584
3Jan 21, 2025 13:2336,5801,249,451,5161,139,184,00067,951,0002,289,664