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 listNov 11, 2025 23:40Aniruddha DebAniruddha DebScore: 14,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 23:4014,473507,370,554428,655,00048,960,0002,330,624
2Nov 11, 2025 23:4014,609512,792,637421,212,00060,886,0002,277,376
3Nov 11, 2025 23:4014,773516,079,469432,579,00054,946,0002,449,408
4Nov 11, 2025 23:4014,782516,855,563429,960,00057,860,0002,473,984
5Nov 11, 2025 23:4014,818518,801,255427,126,00061,873,0002,396,160
6Nov 11, 2025 23:4014,868517,406,642432,676,00057,956,0002,400,256
7Nov 11, 2025 23:4014,875523,102,901433,996,00056,868,0002,359,296
8Nov 11, 2025 23:4014,946521,578,384438,307,00054,913,0002,297,856
9Nov 11, 2025 23:4015,270532,287,697442,045,00061,866,0002,334,720