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 listMar 6, 2026 23:00Pavel SamyginPavel SamyginScore: 16,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 23:0015,698549,368,487500,083,00017,967,0002,514,944
2Mar 6, 2026 23:0015,719553,990,353497,768,00020,948,0002,277,376
3Mar 6, 2026 23:0015,881553,404,390500,107,00023,957,0002,420,736
4Mar 6, 2026 23:0016,057563,930,088511,925,00017,962,0002,269,184
5Mar 6, 2026 23:0016,124567,295,899512,087,00020,003,0002,306,048
6Mar 6, 2026 23:0016,168561,792,806513,571,00019,983,0002,404,352
7Mar 6, 2026 23:0016,221559,217,793513,315,00021,970,0002,387,968
8Mar 6, 2026 23:0016,314564,893,976515,402,00022,973,0002,301,952
9Mar 6, 2026 23:0016,367568,838,448514,144,00025,956,0002,359,296