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 21, 2025 16:56Ian MckibbenIan MckibbenScore: 494,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 16:56493,72916,332,256,03916,213,094,00079,951,0002,310,144
2Jun 21, 2025 16:56494,86816,367,710,71216,228,693,000101,935,0002,478,080
3Jun 21, 2025 16:56494,89816,365,626,42416,227,705,000103,940,0002,326,528