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:08E SequeiraE SequeiraScore: 292,619Success
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:08292,3919,687,301,8459,620,909,00027,979,0002,281,472
2Nov 9, 2024 23:08292,6199,697,833,1389,630,434,00025,982,0002,281,472
3Nov 9, 2024 23:08296,0179,798,034,8539,738,570,00029,980,0002,281,472