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 4, 2026 21:58Павел РатмановПавел РатмановScore: 110,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 21:58110,6673,689,429,1073,626,012,00025,985,0002,351,104
2Jan 4, 2026 21:58110,8863,686,973,6123,632,251,00026,987,0002,400,256
3Jan 4, 2026 21:58111,4813,711,749,0903,652,888,00025,984,0002,285,568