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 03:34Victor MerckléVictor MerckléScore: 4,922Success
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 03:344,907170,009,236125,125,00036,826,0002,113,536
2Jun 27, 2026 03:344,910170,139,434125,131,00036,911,0002,113,536
3Jun 27, 2026 03:344,910170,076,967125,210,00036,826,0002,113,536
4Jun 27, 2026 03:344,916170,169,553124,609,00037,626,0002,113,536
5Jun 27, 2026 03:344,922170,299,305125,569,00036,885,0002,113,536
6Jun 27, 2026 03:344,932170,889,237125,829,00036,952,0002,113,536
7Jun 27, 2026 03:344,934170,767,615125,966,00036,886,0002,113,536
8Jun 27, 2026 03:344,935170,650,589126,220,00036,662,0002,113,536
9Jun 27, 2026 03:344,941170,891,437126,144,00036,914,0002,113,536