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 5, 2026 21:26olliecrowolliecrowScore: 14,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 21:2614,349497,681,525464,520,0008,990,0002,383,872
2Mar 5, 2026 21:2614,356502,822,714465,737,0007,995,0002,334,720
3Mar 5, 2026 21:2614,382501,658,860467,603,0006,994,0002,310,144
4Mar 5, 2026 21:2614,384499,315,295465,683,0008,993,0002,506,752
5Mar 5, 2026 21:2614,413498,697,277466,631,0008,992,0002,490,368
6Mar 5, 2026 21:2614,432500,232,802468,258,0008,004,0002,531,328
7Mar 5, 2026 21:2614,457505,881,853468,079,0009,001,0002,330,624
8Mar 5, 2026 21:2614,502504,503,926468,587,0009,991,0002,310,144
9Mar 5, 2026 21:2614,533506,555,420469,599,0009,991,0002,330,624