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 13:23SneedSneedScore: 30,493Success
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 13:2330,3981,031,242,612977,171,00025,977,0002,383,872
2Mar 15, 2026 13:2330,4061,026,624,405976,421,00026,983,0002,400,256
3Mar 15, 2026 13:2330,4111,027,895,535982,588,00020,991,0002,400,256
4Mar 15, 2026 13:2330,4341,033,200,798980,350,00023,984,0002,404,352
5Mar 15, 2026 13:2330,4931,036,252,553977,297,00028,979,0002,400,256
6Mar 15, 2026 13:2330,5031,036,080,843981,625,00024,990,0002,400,256
7Mar 15, 2026 13:2330,5061,031,442,700983,693,00022,992,0002,289,664
8Mar 15, 2026 13:2330,5151,032,186,213983,005,00024,000,0002,273,280
9Mar 15, 2026 13:2330,7831,048,513,046994,848,00020,996,0002,318,336