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 10, 2025 23:36Ian MckibbenIan MckibbenScore: 171,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 23:36170,6605,664,297,6395,605,790,00025,985,0002,420,736
2Jan 10, 2025 23:36171,3635,685,858,2875,625,004,00029,978,0002,273,280
3Jan 10, 2025 23:36172,2415,720,310,7025,660,984,00022,983,0002,355,200