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 listAug 14, 2025 20:49Aniruddha DebAniruddha DebScore: 17,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 20:4917,550609,102,427530,234,00048,929,0002,347,008
2Aug 14, 2025 20:4917,615607,268,303535,351,00045,944,0002,351,104
3Aug 14, 2025 20:4917,620618,003,468538,489,00042,959,0002,347,008
4Aug 14, 2025 20:4917,654607,605,164537,607,00044,967,0002,437,120
5Aug 14, 2025 20:4917,678613,499,898537,429,00045,951,0002,359,296
6Aug 14, 2025 20:4917,691615,610,209535,913,00047,902,0002,334,720
7Aug 14, 2025 20:4917,733611,001,722543,234,00041,940,0002,351,104
8Aug 14, 2025 20:4917,880617,470,834543,129,00046,924,0002,342,912
9Aug 14, 2025 20:4918,045624,392,179553,585,00041,892,0002,347,008