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 24, 2026 09:14Victor MerckléVictor MerckléScore: 4,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:154,846167,592,036123,140,00036,800,0002,113,536
2Jun 24, 2026 09:154,851167,567,932123,187,00036,909,0002,113,536
3Jun 24, 2026 09:154,853167,679,483122,557,00037,605,0002,113,536
4Jun 24, 2026 09:154,858167,820,208122,765,00037,571,0002,113,536
5Jun 24, 2026 09:154,859167,990,121122,721,00037,656,0002,113,536
6Jun 24, 2026 09:154,865168,237,523123,879,00036,675,0002,113,536
7Jun 24, 2026 09:154,871168,185,187122,999,00037,750,0002,113,536
8Jun 24, 2026 09:154,882168,564,131123,214,00037,893,0002,113,536
9Jun 24, 2026 09:154,893174,516,620123,719,00037,775,0002,113,536