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 14:58Victor MerckléVictor MerckléScore: 4,755Success
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 14:594,740164,164,523119,854,00036,583,0002,113,536
2Jun 27, 2026 14:594,749164,494,877119,922,00036,814,0002,113,536
3Jun 27, 2026 14:594,751164,667,362119,970,00036,836,0002,113,536
4Jun 27, 2026 14:594,753164,666,627120,083,00036,775,0002,113,536
5Jun 27, 2026 14:594,755164,583,061120,306,00036,626,0002,113,536
6Jun 27, 2026 14:594,762166,542,244120,221,00036,931,0002,113,536
7Jun 27, 2026 14:594,783165,962,726121,179,00036,682,0002,113,536
8Jun 27, 2026 14:594,787165,896,841120,351,00037,645,0002,113,536
9Jun 27, 2026 14:594,803166,593,145121,745,00036,781,0002,113,536