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 listDec 22, 2025 22:32zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:35011,399,9141,649,0001,648,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:35010,905,9541,580,0001,580,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:35011,039,4611,638,0001,637,0002,121,728expected "16384 ", got "32 "stderr
4Dec 22, 2025 22:324,237163,458,384130,845,0008,989,0002,351,104
5Dec 22, 2025 22:324,293172,483,325134,701,0006,984,0002,310,144
6Dec 22, 2025 22:324,298165,503,046129,845,00011,985,0002,424,832