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 22, 2024 07:36Alex KentAlex KentScore: 68,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 07:3668,6692,292,807,4222,239,091,00026,989,0002,326,528
2Sep 22, 2024 07:3668,8272,299,625,5542,250,309,00020,993,0002,445,312
3Sep 22, 2024 07:3669,3792,316,603,3352,267,515,00021,985,0002,469,888