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 12, 2026 04:43Josu San MartinJosu San MartinScore: 4,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:434,527173,357,159148,373,0001,002,0002,289,664
2Jan 12, 2026 04:434,529180,061,255148,442,0001,002,0002,289,664
3Jan 12, 2026 04:434,529183,132,489147,458,0002,006,0002,289,664
4Jan 12, 2026 04:434,531177,924,336148,504,0001,003,0002,289,664
5Jan 12, 2026 04:434,531173,646,257148,509,0001,003,0002,400,256
6Jan 12, 2026 04:434,536176,939,348148,685,000997,0002,387,968