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 listJul 20, 2026 14:50boop34boop34Score: 202,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 14:51199,9816,609,633,6916,541,515,00057,869,0002,113,536
2Jul 20, 2026 14:51202,7956,702,232,5676,644,075,00048,189,0002,113,536
3Jul 20, 2026 14:51203,8276,736,906,4556,677,813,00048,486,0002,113,536