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 listMar 24, 2026 06:12Dominique GarmierDominique GarmierScore: 19,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:1219,531671,165,362636,542,0007,994,0002,289,664
2Mar 24, 2026 06:1219,539670,291,587639,775,0004,998,0002,351,104
3Mar 24, 2026 06:1219,575675,693,922639,988,0005,999,0002,289,664