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 listOct 18, 2026 22:47e1011e1011Score: 28,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 22:4928,345946,459,142904,094,00031,317,0002,113,536
2Oct 18, 2026 22:4928,351946,607,820903,864,00031,744,0002,113,536
3Oct 18, 2026 22:4928,377947,469,023904,211,00032,248,0002,113,536
4Oct 18, 2026 22:4928,410948,560,307905,336,00032,203,0002,113,536
5Oct 18, 2026 22:4928,430949,273,097905,953,00032,266,0002,113,536
6Oct 18, 2026 22:4928,448950,348,441906,750,00032,060,0002,113,536
7Oct 18, 2026 22:4928,476951,313,258908,389,00031,334,0002,113,536
8Oct 18, 2026 22:4928,522952,370,442909,382,00031,871,0002,113,536
9Oct 18, 2026 22:4928,583954,280,732911,269,00031,982,0002,113,536