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 17, 2026 23:31Josu San MartinJosu San MartinScore: 3,570Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 06:13C#_user10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:383,557127,110,494115,301,0002,107,0002,129,920
2Aug 17, 2026 23:383,559127,535,291116,404,0001,056,0002,179,072
3Aug 17, 2026 23:383,566127,494,050115,635,0002,072,0002,129,920
4Aug 17, 2026 23:383,568127,533,802115,607,0002,157,0002,129,920
5Aug 17, 2026 23:383,570127,598,681115,735,0002,099,0002,129,920
6Aug 17, 2026 23:383,570127,533,516115,738,0002,075,0002,129,920
7Aug 17, 2026 23:383,574127,751,894115,840,0002,104,0002,129,920
8Aug 17, 2026 23:383,574127,677,694115,835,0002,113,0002,129,920
9Aug 17, 2026 23:383,582127,935,927116,034,0002,181,0002,129,920