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:42Maya 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:420675,353,019662,933,0003,181,0002,113,536expected "1019629 ", got "2567 "
2Jun 4, 2026 23:420675,172,739662,776,0003,016,0002,113,536expected "1018698 ", got "2671 "
3Jun 4, 2026 23:420675,003,348662,597,0003,106,0002,113,536expected "1020037 ", got "2554 "