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 03:26Josu San MartinJosu San MartinScore: 3,701Success
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 03:273,690131,206,391120,703,0001,068,0002,113,536
2May 13, 2026 03:273,691133,383,231120,746,0001,075,0002,113,536
3May 13, 2026 03:273,697132,252,382120,942,0001,084,0002,113,536
4May 13, 2026 03:273,700131,965,586121,028,0001,096,0002,113,536
5May 13, 2026 03:273,701133,257,146121,073,0001,072,0002,113,536
6May 13, 2026 03:273,702133,386,524121,073,0001,120,0002,113,536
7May 13, 2026 03:273,708133,194,833121,330,0001,065,0002,113,536
8May 13, 2026 03:273,711132,372,488121,359,0001,136,0002,113,536
9May 13, 2026 03:273,712132,280,024121,380,0001,116,0002,113,536