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 listJun 23, 2025 16:46Ian MckibbenIan MckibbenScore: 76,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 16:4676,3372,546,482,6922,367,244,000151,887,0002,392,064
2Jun 23, 2025 16:4676,5992,551,993,2872,353,837,000173,914,0002,269,184
3Jun 23, 2025 16:4676,9382,564,515,2732,386,079,000152,876,0002,322,432