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 5, 2026 18:17Павел РатмановПавел РатмановScore: 118,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 18:17117,4143,910,413,2823,843,693,00030,973,000217,088
2Jan 5, 2026 18:17118,3093,935,553,0213,874,222,00029,970,000188,416
3Jan 5, 2026 18:17122,7524,083,453,7834,020,874,00029,946,000204,800