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 listOct 11, 2024 08:09Vladimir TatVladimir TatScore: 155,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 08:09154,4365,128,234,8425,077,405,00018,990,0002,433,024
2Oct 11, 2024 08:09155,0545,147,010,3155,090,798,00025,983,0002,531,328
3Oct 11, 2024 08:09156,0075,179,803,3055,132,236,00015,991,0002,355,200