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 21:39Victor MerckléVictor MerckléScore: 3,665Success
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 21:403,658128,993,584119,558,0001,169,0002,113,536
2Jun 27, 2026 21:403,659128,560,500119,642,0001,130,0002,113,536
3Jun 27, 2026 21:403,661129,096,541119,646,0001,177,0002,113,536
4Jun 27, 2026 21:403,662128,635,990119,767,0001,106,0002,113,536
5Jun 27, 2026 21:403,665130,650,188119,792,0001,171,0002,113,536
6Jun 27, 2026 21:403,666129,344,799119,804,0001,184,0002,113,536
7Jun 27, 2026 21:403,666128,886,758119,825,0001,168,0002,113,536
8Jun 27, 2026 21:403,672130,053,976120,002,0001,179,0002,113,536
9Jun 27, 2026 21:403,708130,399,546121,063,0001,331,0002,113,536