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 22, 2026 20:14Victor MerckléVictor MerckléScore: 4,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 20:154,974171,916,339127,637,00036,527,0002,113,536
2Jun 22, 2026 20:154,975172,223,447127,466,00036,715,0002,113,536
3Jun 22, 2026 20:154,980172,183,453127,577,00036,774,0002,113,536
4Jun 22, 2026 20:154,982172,464,339127,650,00036,785,0002,113,536
5Jun 22, 2026 20:154,983172,449,283127,665,00036,800,0002,113,536
6Jun 22, 2026 20:154,985172,658,965127,797,00036,738,0002,113,536
7Jun 22, 2026 20:154,991172,149,762127,813,00036,904,0002,113,536
8Jun 22, 2026 20:154,997172,417,363128,076,00036,852,0002,113,536
9Jun 22, 2026 20:155,013173,250,848128,581,00036,856,0002,113,536