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 22, 2026 23:28Victor MerckléVictor MerckléScore: 4,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 23:294,953171,096,132126,746,00036,734,0002,113,536
2Jun 22, 2026 23:294,964171,434,460126,949,00036,880,0002,113,536
3Jun 22, 2026 23:294,968171,465,892127,097,00036,862,0002,113,536
4Jun 22, 2026 23:294,972171,833,891127,248,00036,858,0002,113,536
5Jun 22, 2026 23:294,975172,092,805127,219,00036,988,0002,113,536
6Jun 22, 2026 23:294,979171,942,021127,578,00036,734,0002,113,536
7Jun 22, 2026 23:294,980172,381,682126,753,00037,588,0002,113,536
8Jun 22, 2026 23:294,981171,902,562127,584,00036,813,0002,113,536
9Jun 22, 2026 23:294,994172,411,151127,949,00036,877,0002,113,536