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 listAug 6, 2026 14:15C21C21Score: 192,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 14:16192,2056,353,258,1236,293,034,00049,759,0002,113,536
2Aug 6, 2026 14:16192,7156,369,828,0286,305,494,00054,107,0002,113,536
3Aug 6, 2026 14:16193,5026,395,733,8196,328,676,00056,905,0002,113,536