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 listJun 4, 2026 21:57Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 21:5806,442,529,0546,383,599,00048,806,0002,113,536expected "1019857 ", got "30000000 "
2Jun 4, 2026 21:5806,475,394,9986,417,558,00048,331,0002,113,536expected "1024613 ", got "30000000 "
3Jun 4, 2026 21:5806,511,321,9946,452,506,00049,071,0002,113,536expected "1019133 ", got "30000000 "