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 listDec 17, 2025 18:43Rajarshi BasuRajarshi BasuScore: 27,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:4327,099923,472,239880,269,00013,988,0002,465,792
2Dec 17, 2025 18:4327,268923,405,902884,836,00014,997,0002,416,640
3Dec 17, 2025 18:4327,496933,262,058895,387,00011,978,0002,281,472