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 23:40Maya 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 23:410675,743,923663,006,0003,024,0002,113,536expected "1023604 ", got "170617 "
2Jun 4, 2026 23:410675,784,021662,789,0003,103,0002,113,536expected "1020491 ", got "169973 "
3Jun 4, 2026 23:410675,778,038662,881,0003,131,0002,113,536expected "1021811 ", got "170401 "