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 25, 2026 17:36boop34boop34Score: 6,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:376,611229,287,308215,040,0003,133,0002,113,536
2Jul 25, 2026 17:376,630230,014,700215,826,0002,967,0002,113,536
3Jul 25, 2026 17:376,651229,345,102215,181,0004,327,0002,113,536
4Jul 25, 2026 17:376,653229,876,412215,701,0003,877,0002,113,536
5Jul 25, 2026 17:376,654229,403,078215,469,0004,138,0002,113,536
6Jul 25, 2026 17:376,658229,772,886215,597,0004,135,0002,113,536
7Jul 25, 2026 17:376,737232,190,247218,164,0004,183,0002,113,536
8Jul 25, 2026 17:376,746232,511,203218,184,0004,448,0002,113,536
9Jul 25, 2026 17:376,752232,737,434218,572,0004,261,0002,113,536