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 listJun 28, 2026 16:04Du BinDu BinScore: 192,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 16:05192,0796,348,410,7326,289,779,00048,847,0002,113,536
2Jun 28, 2026 16:05192,6066,365,640,8746,296,269,00059,739,0002,113,536
3Jun 28, 2026 16:05193,3486,396,036,2526,321,191,00059,317,0002,113,536