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 12, 2026 22:17Josu San MartinJosu San MartinScore: 4,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:164,475174,836,324144,684,0002,993,0002,269,184
2Jan 12, 2026 22:164,476171,849,137146,700,000997,0002,269,184
3Jan 12, 2026 22:164,481175,072,369145,872,0001,998,0002,289,664
4Jan 12, 2026 22:154,527181,616,368147,390,0002,005,0002,326,528
5Jan 12, 2026 22:154,528178,035,711148,412,0001,002,0002,408,448
6Jan 12, 2026 22:154,533176,249,073148,602,000997,0002,289,664
7Jan 12, 2026 22:174,573179,198,960148,900,0001,998,0002,437,120
8Jan 12, 2026 22:174,579181,092,862150,095,0001,000,0002,396,160
9Jan 12, 2026 22:174,579174,484,964149,106,0002,001,0002,289,664