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 listNov 9, 2024 23:22E SequeiraE SequeiraScore: 215,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2024 23:22214,1757,099,883,7507,015,793,00051,968,0002,285,568
2Nov 9, 2024 23:22215,1857,129,032,2817,044,116,00056,976,0002,519,040
3Nov 9, 2024 23:22216,3747,175,207,0517,085,386,00054,964,0002,363,392