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 listOct 6, 2026 05:06Karthik ReddyKarthik ReddyScore: 2,874Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 19:18Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 05:072,855103,304,71093,173,0001,044,00020,480
2Oct 6, 2026 05:072,858103,354,42493,317,0001,004,00020,480
3Oct 6, 2026 05:072,862103,553,28393,460,0001,004,00020,480
4Oct 6, 2026 05:072,867103,786,29893,579,0001,053,00020,480
5Oct 6, 2026 05:072,874104,025,33193,862,0001,007,00020,480
6Oct 6, 2026 05:072,883104,269,79694,079,0001,064,00020,480
7Oct 6, 2026 05:072,888104,347,64994,281,0001,037,00020,480
8Oct 6, 2026 05:072,910105,143,50894,998,0001,058,00020,480
9Oct 6, 2026 05:072,936105,962,97795,824,0001,072,00020,480