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 02:53Victor MerckléVictor MerckléScore: 4,974Success
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 02:544,962171,487,342126,891,00036,859,0002,113,536
2Jun 27, 2026 02:544,965171,508,852126,995,00036,859,0002,113,536
3Jun 27, 2026 02:544,970171,678,388127,125,00036,909,0002,113,536
4Jun 27, 2026 02:544,972171,768,061127,063,00037,019,0002,113,536
5Jun 27, 2026 02:544,974171,865,298127,289,00036,873,0002,113,536
6Jun 27, 2026 02:544,996172,878,799128,040,00036,860,0002,113,536
7Jun 27, 2026 02:545,003172,822,124127,440,00037,685,0002,113,536
8Jun 27, 2026 02:545,012173,346,946128,650,00036,759,0002,113,536
9Jun 27, 2026 02:545,024173,765,662128,195,00037,626,0002,113,536