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 listJan 1, 2026 19:18zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:37Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:38010,922,0251,042,0002,180,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:38011,111,9671,045,0002,324,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:38010,950,8131,041,0002,165,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 19:183,580143,106,226115,147,0003,003,0002,445,312
5Jan 1, 2026 19:183,629140,596,698117,765,0001,996,0002,273,280
6Jan 1, 2026 19:183,638145,748,729118,052,0002,000,0002,416,640