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 listJan 14, 2026 19:36Josu San MartinJosu San MartinScore: 4,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 19:354,303173,281,176139,993,0001,999,0002,289,664
2Jan 14, 2026 19:354,306166,296,180139,088,0003,001,0002,289,664
3Jan 14, 2026 19:354,306171,077,990140,104,0002,001,0002,396,160
4Jan 14, 2026 19:354,611175,382,732151,170,0001,001,0002,285,568
5Jan 14, 2026 19:354,613176,921,665152,234,00002,285,568
6Jan 14, 2026 19:354,628181,978,556150,717,0001,996,0002,285,568
7Jan 14, 2026 19:364,804187,226,065155,549,0002,991,0002,408,448
8Jan 14, 2026 19:364,808182,652,417155,655,0002,993,0002,297,856
9Jan 14, 2026 19:364,813182,124,805155,823,0002,996,0002,297,856