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 listMar 15, 2026 07:14tqbfjotld-0tqbfjotld-0Score: 70,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 07:1470,4372,349,075,1692,082,573,000241,834,0002,383,872
2Mar 15, 2026 07:1470,5042,353,716,1202,080,767,000245,854,0002,519,040
3Mar 15, 2026 07:1473,1562,441,550,8082,173,320,000240,813,0002,506,752