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 listMay 12, 2026 07:22Victor MerckléVictor MerckléScore: 6,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 07:236,632227,940,022181,471,00037,385,0002,113,536
2May 12, 2026 07:236,643228,409,158181,784,00037,445,0002,113,536
3May 12, 2026 07:236,673227,907,152182,560,00037,673,0002,113,536
4May 12, 2026 07:236,683227,843,877182,817,00037,728,0002,113,536
5May 12, 2026 07:236,683230,844,176182,121,00038,449,0002,113,536
6May 12, 2026 07:236,688229,829,631182,116,00038,598,0002,113,536
7May 12, 2026 07:236,690230,311,119182,039,00038,733,0002,113,536
8May 12, 2026 07:236,690229,108,447183,124,00037,667,0002,113,536
9May 12, 2026 07:236,743231,797,577184,841,00037,697,0002,113,536