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 listJan 16, 2026 02:26Josu San MartinJosu San MartinScore: 5,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 02:275,188198,160,662169,192,0002,002,0002,289,664
2Jan 16, 2026 02:265,192192,536,843170,324,0001,001,0002,289,664
3Jan 16, 2026 02:275,192198,348,773169,334,0002,003,0002,383,872
4Jan 16, 2026 02:265,199197,352,210171,583,00002,502,656
5Jan 16, 2026 02:265,231199,269,135170,633,0001,995,0002,457,600
6Jan 16, 2026 02:275,231202,519,005169,617,0002,993,0002,289,664