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:42Ian MckibbenIan MckibbenScore: 266,826Success
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:42266,4768,824,704,8658,695,770,00097,941,0002,478,080
2Jun 21, 2025 17:42266,8268,840,979,5318,721,288,00083,954,0002,424,832
3Jun 21, 2025 17:42268,8768,905,320,3248,777,982,00094,934,0002,375,680