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 22, 2025 06:42Rajarshi BasuRajarshi BasuScore: 31,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 06:4231,5031,070,562,8021,027,606,00011,995,0002,469,888
2Dec 22, 2025 06:4231,9411,084,045,2761,037,064,00017,001,0002,465,792
3Dec 22, 2025 06:4233,9391,152,715,1391,106,994,00012,988,0002,293,760