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 8, 2026 20:13Павел РатмановПавел РатмановScore: 41,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:1341,5991,395,750,4031,361,775,00010,998,0002,330,624
2Jan 8, 2026 20:1341,9361,411,339,1601,370,909,00012,989,0002,273,280
3Jan 8, 2026 20:1341,9871,409,424,3721,373,559,00011,996,0002,318,336