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 listSep 25, 2025 15:13Wookyung JeongWookyung JeongScore: 185,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 15:13185,1726,138,694,5046,025,733,00084,953,0002,494,464
2Sep 25, 2025 15:13185,6546,157,845,1856,048,624,00077,943,0002,531,328
3Sep 25, 2025 15:13186,9336,201,851,9776,085,842,00082,956,0002,310,144