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 listSep 21, 2024 16:10Alex KentAlex KentScore: 70,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2024 16:1070,0102,338,916,8892,278,335,00031,990,0002,273,280
2Sep 21, 2024 16:1070,2262,339,542,5252,275,471,00041,971,0002,486,272
3Sep 21, 2024 16:1070,3312,353,318,5582,282,934,00037,982,0002,273,280