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 3, 2024 20:50Jatin YadavJatin YadavScore: 189,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 20:50188,9786,263,211,9646,233,277,0002,997,0002,277,376
2Sep 3, 2024 20:50189,0516,272,702,6626,235,701,0002,997,0002,527,232
3Sep 3, 2024 20:50189,0726,266,984,6396,237,387,0001,998,0002,527,232