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 listMay 13, 2026 05:09Josu San MartinJosu San MartinScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:103,508126,165,268114,730,0001,058,0002,113,536
2May 13, 2026 05:103,515125,181,479114,893,0001,122,0002,113,536
3May 13, 2026 05:103,518125,768,250115,057,0001,062,0002,113,536
4May 13, 2026 05:103,522127,912,445115,135,0001,120,0002,113,536
5May 13, 2026 05:103,524125,179,333115,237,0001,081,0002,113,536
6May 13, 2026 05:103,529127,124,749115,344,0001,137,0002,113,536
7May 13, 2026 05:103,531125,260,779115,410,0001,122,0002,113,536
8May 13, 2026 05:103,532125,698,779115,445,0001,125,0002,113,536
9May 13, 2026 05:103,532126,410,989115,428,0001,133,0002,113,536