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 16, 2026 23:17Dominique GarmierDominique GarmierScore: 37,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 23:1736,6051,241,213,6521,197,961,0009,999,0002,355,200
2Mar 16, 2026 23:1737,5081,265,652,7311,225,762,00011,997,0002,371,584
3Mar 16, 2026 23:1739,3381,323,992,5351,287,172,00010,992,0002,441,216