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 21, 2025 06:11Rajarshi BasuRajarshi BasuScore: 237,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 06:11236,3077,831,333,4297,770,136,00027,982,0002,465,792
2Dec 21, 2025 06:11237,8727,887,506,1247,819,809,00029,980,0002,355,200
3Dec 21, 2025 06:11241,1047,988,634,4067,920,449,00035,974,0002,473,984