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 03:29Victor MerckléVictor MerckléScore: 4,822Success
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 03:294,808166,270,451121,952,00036,726,0002,113,536
2Jun 27, 2026 03:294,818166,943,364122,295,00036,701,0002,113,536
3Jun 27, 2026 03:294,819168,460,752122,132,00036,910,0002,113,536
4Jun 27, 2026 03:294,819166,936,092122,212,00036,828,0002,113,536
5Jun 27, 2026 03:294,822167,013,850122,285,00036,872,0002,113,536
6Jun 27, 2026 03:294,831167,030,694122,566,00036,857,0002,113,536
7Jun 27, 2026 03:294,833167,519,902122,542,00036,955,0002,113,536
8Jun 27, 2026 03:294,843167,706,355122,889,00036,933,0002,113,536
9Jun 27, 2026 03:294,847168,209,141122,184,00037,787,0002,113,536