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 listOct 17, 2026 07:14e1011e1011Score: 66,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 07:1665,2652,164,962,4232,145,537,0008,214,0002,113,536
2Oct 17, 2026 07:1665,8392,183,734,3262,164,745,0007,961,0002,113,536
3Oct 17, 2026 07:1666,1342,193,352,9862,174,208,0008,238,0002,113,536
4Oct 17, 2026 07:1666,1892,195,291,8422,176,299,0007,944,0002,113,536
5Oct 17, 2026 07:1666,2042,196,375,7382,176,334,0008,426,0002,113,536
6Oct 17, 2026 07:1666,2142,196,024,5472,177,098,0007,967,0002,113,536
7Oct 17, 2026 07:1666,5602,208,013,6352,188,584,0007,923,0002,113,536
8Oct 17, 2026 07:1666,6512,210,489,8462,191,717,0007,790,0002,113,536
9Oct 17, 2026 07:1668,6082,275,213,6122,255,046,0009,030,0002,113,536