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 18, 2025 05:17Ian MckibbenIan MckibbenScore: 31,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 05:1730,9351,048,725,165876,879,000143,980,0002,318,336
2Jan 18, 2025 05:1731,0491,050,671,184883,669,000140,947,0002,318,336
3Jan 18, 2025 05:1731,3661,063,414,323904,181,000130,881,0002,433,024