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 8, 2026 09:24anboto1anboto1Score: 5,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 09:255,555193,014,448174,905,0008,423,0002,117,632
2Jun 8, 2026 09:255,561192,831,694174,261,0009,275,0002,117,632
3Jun 8, 2026 09:255,579193,984,094174,922,0009,210,0002,117,632
4Jun 8, 2026 09:255,584193,518,229175,117,0009,176,0002,117,632
5Jun 8, 2026 09:255,588193,691,301175,152,0009,268,0002,117,632
6Jun 8, 2026 09:255,595194,444,615176,374,0008,278,0002,117,632
7Jun 8, 2026 09:255,597193,958,814175,422,0009,285,0002,117,632
8Jun 8, 2026 09:255,640195,795,126176,840,0009,292,0002,117,632
9Jun 8, 2026 09:255,649195,661,729177,145,0009,292,0002,117,632