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 27, 2025 18:19Aryan JainAryan JainScore: 304,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2025 18:19302,13810,003,584,5269,886,625,00083,945,0002,424,832
2Aug 27, 2025 18:19303,03110,035,225,8489,911,071,00088,937,0002,416,640
3Aug 27, 2025 18:19303,51810,054,324,6139,946,122,00069,958,0002,351,104
4Aug 27, 2025 18:19304,39110,074,345,2179,969,965,00074,954,0002,449,408
5Aug 27, 2025 18:19304,62110,086,444,0139,979,540,00072,952,0002,441,216
6Aug 27, 2025 18:19305,99610,129,529,61610,019,904,00077,952,0002,301,952
7Aug 27, 2025 18:19306,08810,138,819,31910,027,957,00072,956,0002,347,008
8Aug 27, 2025 18:19306,14910,137,244,71210,028,951,00073,955,0002,310,144
9Aug 27, 2025 18:19306,28410,144,009,00510,040,409,00066,962,0002,314,240