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 17:36Ian MckibbenIan MckibbenScore: 267,431Success
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 17:36267,0598,851,784,1488,717,025,00095,934,0002,506,752
2Jun 21, 2025 17:36267,4318,858,008,3868,730,268,00094,948,0002,502,656
3Jun 21, 2025 17:36269,3738,919,293,9198,797,370,00091,941,0002,498,560