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 listJun 27, 2026 01:12Victor MerckléVictor MerckléScore: 4,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:124,872168,973,174125,104,00035,696,0002,113,536
2Jun 27, 2026 01:124,878168,666,822124,147,00036,830,0002,113,536
3Jun 27, 2026 01:124,878168,725,105124,239,00036,760,0002,113,536
4Jun 27, 2026 01:124,886170,551,055124,445,00036,810,0002,113,536
5Jun 27, 2026 01:124,888168,821,247124,525,00036,806,0002,113,536
6Jun 27, 2026 01:124,894169,628,328124,830,00036,704,0002,113,536
7Jun 27, 2026 01:124,904169,909,004124,857,00036,999,0002,113,536
8Jun 27, 2026 01:124,906169,486,257125,019,00036,889,0002,113,536
9Jun 27, 2026 01:124,907169,724,241125,128,00036,815,0002,113,536