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 23, 2024 15:12E SequeiraE SequeiraScore: 75,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 23, 2024 15:1274,3962,482,924,0612,431,067,00023,990,0002,285,568
2Nov 23, 2024 15:1275,1852,512,452,1882,457,142,00023,972,0002,392,064
3Nov 23, 2024 15:1275,9012,539,753,4982,481,777,00022,970,0002,281,472