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 listDec 30, 2025 17:54zielajzielajScore: 3,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 17:513,627142,402,861109,703,0009,973,0002,285,568
2Dec 30, 2025 17:533,632141,009,384112,854,0006,990,0002,285,568
3Dec 30, 2025 17:543,632145,397,950111,858,0007,989,0002,478,080
4Dec 30, 2025 17:533,633143,410,428112,895,0006,993,0002,289,664
5Dec 30, 2025 17:513,643143,409,196110,197,00010,017,0002,285,568
6Dec 30, 2025 17:533,648155,046,468112,372,0008,026,0002,281,472
7Dec 30, 2025 17:543,656145,673,854113,670,0006,979,0002,449,408
8Dec 30, 2025 17:513,664148,295,852114,921,0005,995,0002,289,664
9Dec 30, 2025 17:543,717145,792,609112,700,0009,973,0002,387,968