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 listMar 7, 2023 20:03Saveliev AntonSaveliev AntonError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2023 20:0300000Error: Exit with code 1: 2023/03/07 20:03:29 [111 65 119 64 109 68 114 81 107 110 82 10 114 52 65 110 80 10 56 114 103 10 117 64 37 109 81 52 109 74 116 114 65 116 73 10 103 107 64 85 76]stderr