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 listJul 31, 2026 13:25CodeReclaimersCodeReclaimersScore: 8,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:268,886303,388,007256,507,00036,755,0002,113,536
2Jul 31, 2026 13:268,892303,508,298256,756,00036,707,0002,113,536
3Jul 31, 2026 13:268,908304,813,384258,323,00035,670,0002,113,536
4Jul 31, 2026 13:268,951305,530,865258,615,00036,791,0002,113,536
5Jul 31, 2026 13:268,954305,634,401258,780,00036,726,0002,113,536
6Jul 31, 2026 13:268,965306,582,230259,145,00036,707,0002,113,536
7Jul 31, 2026 13:269,069309,830,186261,714,00037,594,0002,113,536
8Jul 31, 2026 13:269,088309,980,166262,429,00037,492,0002,113,536
9Jul 31, 2026 13:269,205314,615,672266,885,00036,896,0002,113,536