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 21:01Jatin YadavJatin YadavScore: 66,529Success
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 21:0165,5552,187,865,9422,145,311,00017,994,0002,441,216
2Sep 3, 2024 21:0166,5292,219,966,4152,179,485,00015,988,0002,445,312
3Sep 3, 2024 21:0170,2882,343,622,7412,307,516,00011,992,0002,531,328