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 listFeb 12, 2026 04:00olliecrowolliecrowScore: 14,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 04:0014,342500,913,843465,287,0008,004,0002,490,368
2Feb 12, 2026 04:0014,451502,621,824467,887,0008,997,0002,326,528
3Feb 12, 2026 04:0014,458503,826,848468,114,0009,002,0002,334,720