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 23, 2026 00:29Victor MerckléVictor MerckléScore: 4,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 00:304,949170,948,669126,503,00036,818,0002,113,536
2Jun 23, 2026 00:304,956171,054,551126,726,00036,839,0002,113,536
3Jun 23, 2026 00:304,967171,999,994127,002,00036,914,0002,113,536
4Jun 23, 2026 00:304,970172,006,796127,132,00036,886,0002,113,536
5Jun 23, 2026 00:304,970171,787,134127,151,00036,882,0002,113,536
6Jun 23, 2026 00:304,977171,754,831127,316,00036,934,0002,113,536
7Jun 23, 2026 00:304,978172,309,089126,570,00037,723,0002,113,536
8Jun 23, 2026 00:304,985171,937,638126,764,00037,750,0002,113,536
9Jun 23, 2026 00:304,987172,106,314126,830,00037,771,0002,113,536