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 13, 2026 15:01Tomislav TunkovicTomislav TunkovicScore: 15,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:0115,705526,631,230515,031,0003,246,0002,121,728stderr
2Aug 13, 2026 15:0115,758528,512,125516,816,0003,205,0002,121,728stderr
3Aug 13, 2026 15:0115,823530,714,453518,935,0003,232,0002,121,728stderr