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 27, 2026 00:50Victor MerckléVictor MerckléScore: 4,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:514,844167,433,477122,943,00036,933,0002,113,536
2Jun 27, 2026 00:514,851167,983,980123,203,00036,905,0002,113,536
3Jun 27, 2026 00:514,855168,235,980123,314,00036,908,0002,113,536
4Jun 27, 2026 00:514,861168,452,390123,685,00036,730,0002,113,536
5Jun 27, 2026 00:514,865168,640,347123,738,00036,808,0002,113,536
6Jun 27, 2026 00:514,875168,448,200123,475,00037,400,0002,113,536
7Jun 27, 2026 00:514,880169,108,031123,285,00037,760,0002,113,536
8Jun 27, 2026 00:514,890169,004,959123,520,00037,852,0002,113,536
9Jun 27, 2026 00:514,895169,705,174123,921,00037,635,0002,113,536