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 10, 2026 13:13Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:46Tomislav Tunkovic21.50CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:50020,021,159,85320,008,248,0002,150,00016,384Killed by timeout
2Jan 10, 2026 13:134,824182,329,592159,198,00002,293,760
3Jan 10, 2026 13:134,827183,085,890158,288,0001,001,0002,392,064
4Jan 10, 2026 13:134,829192,074,589158,360,0001,002,0002,293,760