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 20, 2026 03:36Victor MerckléVictor MerckléScore: 6,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 03:376,542223,412,338178,373,00037,537,0002,113,536
2Jun 20, 2026 03:376,548223,940,601178,581,00037,512,0002,113,536
3Jun 20, 2026 03:376,551223,862,963178,608,00037,593,0002,113,536
4Jun 20, 2026 03:376,553223,825,410178,895,00037,365,0002,113,536
5Jun 20, 2026 03:376,553223,811,396178,071,00038,178,0002,113,536
6Jun 20, 2026 03:376,557223,905,158178,061,00038,339,0002,113,536
7Jun 20, 2026 03:376,570224,375,148179,251,00037,591,0002,113,536
8Jun 20, 2026 03:376,574224,771,352179,316,00037,630,0002,113,536
9Jun 20, 2026 03:376,575224,478,399179,395,00037,597,0002,113,536