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 17, 2026 05:28Josu San MartinJosu San MartinScore: 8,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 05:278,687313,525,088226,744,00059,932,0002,457,600
2Mar 17, 2026 05:288,690312,037,602215,833,00070,945,0002,465,792
3Mar 17, 2026 05:278,699312,908,497221,043,00066,012,0002,478,080
4Mar 17, 2026 05:288,713311,119,876226,635,00060,902,0002,486,272
5Mar 17, 2026 05:288,719310,697,488205,813,00081,925,0002,498,560
6Mar 17, 2026 05:288,719308,856,272211,790,00075,924,0002,482,176
7Mar 17, 2026 05:288,729313,021,523231,042,00057,010,0002,457,600
8Mar 17, 2026 05:278,731309,738,817204,092,00084,037,0002,326,528
9Mar 17, 2026 05:288,747317,295,672211,736,00076,904,0002,478,080