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 4, 2025 18:55Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 118,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2025 18:55117,9703,916,758,2233,747,094,000145,925,0002,424,832
2Aug 4, 2025 18:55118,1073,925,966,7863,767,617,000129,917,0002,277,376
3Aug 4, 2025 18:55119,1013,960,004,3513,800,411,000129,911,0002,277,376