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 22:48Maya 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 22:480465,504,145452,666,0003,067,0002,113,536expected "1026341 ", got "270390532 "
2Jun 4, 2026 22:480465,013,561452,721,0003,065,0002,113,536expected "1023233 ", got "270535478 "
3Jun 4, 2026 22:480461,510,635449,229,0003,040,0002,113,536expected "1024032 ", got "270536420 "