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 7, 2026 21:47Josu San MartinJosu San MartinScore: 16,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 21:4715,843549,618,758519,805,0002,998,0002,338,816
2Jan 7, 2026 21:4715,970555,108,583525,010,0002,000,0002,289,664
3Jan 7, 2026 21:4715,979558,063,017525,304,0002,001,0002,342,912
4Jan 7, 2026 21:4716,070557,565,198528,314,0002,001,0002,351,104
5Jan 7, 2026 21:4716,259562,711,756532,536,0003,996,0002,289,664
6Jan 7, 2026 21:4716,302562,945,817533,954,0003,999,0002,342,912
7Jan 7, 2026 21:4716,365568,278,345537,058,0003,000,0002,306,048
8Jan 7, 2026 21:4717,076596,374,019561,503,0001,998,0002,347,008
9Jan 7, 2026 21:4718,701649,069,722614,118,0003,000,0002,342,912