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:51Maya RebholzMaya RebholzScore: 192,648Success
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:52191,8296,339,914,6196,281,668,00048,700,0002,113,536
2Jun 4, 2026 21:52192,6486,366,764,1566,309,149,00048,239,0002,113,536
3Jun 4, 2026 21:52193,5056,395,009,3456,337,165,00048,517,0002,113,536