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 listAug 31, 2026 08:02Tomislav TunkovicTomislav TunkovicScore: 3,058Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 06:13C#_user18.75CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 08:053,041110,138,99999,265,0001,103,00028,672
2Aug 31, 2026 08:053,049110,386,73499,526,0001,096,00028,672
3Aug 31, 2026 08:053,053110,449,92399,666,0001,100,00028,672
4Aug 31, 2026 08:053,058110,624,38999,846,0001,078,00028,672
5Aug 31, 2026 08:053,058110,710,96099,845,0001,094,00032,768
6Aug 31, 2026 08:053,069110,968,579100,207,0001,092,00028,672
7Aug 31, 2026 08:053,083111,880,239100,668,0001,084,00028,672
8Aug 31, 2026 08:053,092111,788,864100,933,0001,106,00032,768
9Aug 31, 2026 08:053,098111,954,585101,162,0001,095,00028,672