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 31, 2025 20:00Павел РатмановПавел РатмановScore: 74,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 20:0073,5652,457,159,1822,385,653,00041,976,0002,523,136
2Dec 31, 2025 20:0074,1072,477,248,0182,395,570,00049,970,0002,420,736
3Dec 31, 2025 20:0074,7822,494,475,3592,419,814,00047,976,0002,392,064