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 listSep 26, 2025 10:54Wookyung JeongWookyung JeongScore: 151,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 10:54150,5994,998,200,4344,897,824,00071,953,0002,486,272
2Sep 26, 2025 10:54151,0625,017,738,6434,912,098,00072,956,0002,490,368
3Sep 26, 2025 10:54151,3045,025,695,1704,919,080,00073,956,0002,273,280
4Sep 26, 2025 10:54151,5355,027,651,1964,930,694,00069,953,0002,420,736
5Sep 26, 2025 10:54151,7105,038,462,9714,943,486,00062,955,0002,392,064
6Sep 26, 2025 10:54151,7525,040,094,2404,951,851,00055,964,0002,285,568
7Sep 26, 2025 10:54151,7545,041,115,7544,930,941,00076,952,0002,494,464
8Sep 26, 2025 10:54152,0835,045,410,8004,939,788,00078,948,0002,338,816
9Sep 26, 2025 10:54152,6755,071,872,3384,970,310,00067,963,0002,351,104