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 28, 2025 02:32Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 20:41Andrew Epstein12.71CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:460588,637,113571,538,0008,167,0002,113,536expected "2107203 ", got "2099003 "
2Oct 15, 2026 20:460594,153,784575,673,0009,470,0002,113,536expected "2107278 ", got "2098860 "
3Oct 15, 2026 20:46026,889,9438,983,0009,076,0002,113,536expected "173 ", got "172 "
4Dec 28, 2025 02:3250,0481,676,712,4451,641,582,0009,997,0002,408,448
5Dec 28, 2025 02:3250,0621,680,498,5531,640,055,00011,993,0002,281,472
6Dec 28, 2025 02:3252,3651,753,485,1851,715,059,00012,992,0002,519,040