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 listMar 15, 2026 22:12Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:33Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:14020,019,659,40120,001,806,0006,698,00016,384Killed by timeout
2Mar 15, 2026 22:1230,2601,026,719,626987,587,00010,995,0002,445,312
3Mar 15, 2026 22:1230,3421,033,838,950993,292,0007,994,0002,367,488
4Mar 15, 2026 22:1230,3761,030,564,679995,406,0006,995,0002,433,024