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:29Ian MckibbenIan MckibbenScore: 121,349Success
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:29120,5044,002,974,4153,958,630,00017,989,0002,322,432
2Jun 23, 2025 16:29121,3494,030,295,2363,980,540,00023,985,0002,314,240
3Jun 23, 2025 16:29122,4254,068,587,3534,018,058,00021,983,0002,437,120