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 9, 2025 19:05Rajarshi BasuRajarshi BasuScore: 147,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 19:05145,5304,828,036,2534,778,495,00023,982,0002,387,968
2Dec 9, 2025 19:05147,5924,898,450,0164,851,545,00018,986,0002,310,144
3Dec 9, 2025 19:05148,4164,928,111,9854,867,740,00029,979,0002,334,720