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 23, 2026 17:17Victor MerckléVictor MerckléScore: 3,180Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:14C#_user10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:173,174113,075,092102,532,0002,233,0002,121,728stderr
2Aug 23, 2026 17:173,176113,934,885102,619,0002,201,0002,121,728stderr
3Aug 23, 2026 17:173,178113,763,634102,677,0002,198,0002,121,728stderr
4Aug 23, 2026 17:173,178113,326,403102,661,0002,215,0002,121,728stderr
5Aug 23, 2026 17:173,180113,966,263102,748,0002,202,0002,121,728stderr
6Aug 23, 2026 17:173,185114,772,733102,778,0002,353,0002,121,728stderr
7Aug 23, 2026 17:173,187116,233,542102,990,0002,208,0002,121,728stderr
8Aug 23, 2026 17:173,195113,841,741103,250,0002,193,0002,121,728stderr
9Aug 23, 2026 17:173,200114,708,483103,360,0002,251,0002,121,728stderr