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:05E SequeiraE SequeiraScore: 80,260Success
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:0579,9472,669,415,4912,615,271,00022,984,0002,334,720
2Nov 23, 2024 15:0580,2602,677,142,8702,621,598,00026,985,0002,281,472
3Nov 23, 2024 15:0580,6752,687,726,4172,637,294,00024,983,0002,383,872