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 15, 2026 01:08limanjun99limanjun99Score: 17,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:0817,178593,500,831562,881,0003,999,0002,265,088
2Mar 15, 2026 01:0817,328597,050,587568,812,0002,999,0002,519,040
3Mar 15, 2026 01:0817,398596,862,833571,132,0003,000,0002,519,040
4Mar 15, 2026 01:0817,415601,707,091570,685,0003,997,0002,359,296
5Mar 15, 2026 01:0817,427599,526,798571,099,0004,000,0002,506,752
6Mar 15, 2026 01:0817,467603,795,867572,401,0003,995,0002,260,992
7Mar 15, 2026 01:0817,597607,161,027579,710,000999,0002,379,776
8Mar 15, 2026 01:0817,637604,833,534577,005,0005,000,0002,519,040
9Mar 15, 2026 01:0818,112629,992,705593,702,0003,997,0002,514,944