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:52E SequeiraE SequeiraScore: 113,232Success
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:52112,5353,742,222,7323,685,669,00027,982,0002,334,720
2Nov 9, 2024 23:52113,2323,765,574,9393,704,683,00031,980,0002,281,472
3Nov 9, 2024 23:52113,4163,772,171,7473,708,748,00033,979,0002,351,104