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 01:53Ian MckibbenIan MckibbenScore: 208,866Success
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 01:53207,1456,864,550,4236,814,812,00020,987,0002,326,528
2Jan 10, 2025 01:53208,8666,931,721,5096,872,584,00019,987,0002,502,656
3Jan 10, 2025 01:53209,8726,960,171,7466,900,784,00024,984,0002,473,984