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:36Jatin YadavJatin YadavScore: 103,362Success
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:36102,8373,419,237,2553,375,649,00017,987,0002,277,376
2Sep 3, 2024 20:36103,3623,439,722,1773,394,972,00015,990,0002,277,376
3Sep 3, 2024 20:36103,6703,452,483,2733,403,124,00017,984,0002,277,376