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 listDec 4, 2025 02:06Yehor BondarYehor BondarScore: 230,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 02:06230,0697,629,134,4187,568,301,00023,985,0002,330,624
2Dec 4, 2025 02:06230,3767,630,784,3177,581,425,00020,987,0002,314,240
3Dec 4, 2025 02:06230,7927,649,629,0917,591,155,00024,987,0002,387,968
4Dec 4, 2025 02:06230,9617,649,959,9817,599,744,00021,984,0002,486,272
5Dec 4, 2025 02:06230,9847,650,325,2377,605,479,00016,989,0002,277,376
6Dec 4, 2025 02:06231,8607,685,964,9137,629,391,00021,986,0002,297,856
7Dec 4, 2025 02:06232,2907,697,969,2987,643,570,00021,984,0002,412,544
8Dec 4, 2025 02:06232,3707,695,609,6097,644,216,00023,984,0002,461,696
9Dec 4, 2025 02:06233,4557,739,427,2697,688,016,00015,989,0002,363,392