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 30, 2025 08:36Rajarshi BasuRajarshi BasuScore: 498,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 08:36495,99816,400,699,58016,309,980,00057,964,0002,289,664
2Dec 30, 2025 08:36498,41116,488,504,53116,387,607,00059,961,0002,510,848
3Dec 30, 2025 08:36501,69516,597,755,30216,492,968,00062,954,0002,494,464