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 listAug 3, 2025 20:43Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 215,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2025 20:43214,7587,111,757,3466,925,108,000161,909,0002,412,544
2Aug 3, 2025 20:43215,1117,126,936,3946,928,774,000169,896,0002,461,696
3Aug 3, 2025 20:43215,8637,150,779,6896,959,576,000163,895,0002,396,160