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 19:25Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 139,401Success
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 19:25138,2824,592,634,6694,343,435,000219,870,0002,277,376
2Aug 3, 2025 19:25139,4014,632,884,0974,360,374,000239,855,0002,277,376
3Aug 3, 2025 19:25140,3804,665,021,3104,405,652,000226,879,0002,277,376