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 21, 2026 04:02Victor MerckléVictor MerckléScore: 6,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 04:036,475221,317,513176,179,00037,505,0002,113,536
2Jun 21, 2026 04:036,495222,221,716176,068,00038,289,0002,113,536
3Jun 21, 2026 04:036,499221,951,844176,019,00038,459,0002,113,536
4Jun 21, 2026 04:036,499221,978,855176,181,00038,297,0002,113,536
5Jun 21, 2026 04:036,515222,551,382177,741,00037,267,0002,113,536
6Jun 21, 2026 04:036,516222,516,093176,793,00038,259,0002,113,536
7Jun 21, 2026 04:036,526222,886,940176,894,00038,489,0002,113,536
8Jun 21, 2026 04:036,528223,003,336177,013,00038,420,0002,113,536
9Jun 21, 2026 04:036,599226,732,898180,523,00037,267,0002,113,536