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 listDec 26, 2025 03:38Josu San MartinJosu San MartinScore: 27,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:3827,396933,333,637897,070,0007,000,0002,396,160
2Dec 26, 2025 03:3827,438930,963,934896,445,0008,994,0002,478,080
3Dec 26, 2025 03:3827,448934,770,231894,774,00010,997,0002,342,912
4Dec 26, 2025 03:3827,630937,333,147904,792,0006,998,0002,428,928
5Dec 26, 2025 03:3827,763945,529,046905,184,00010,990,0002,326,528
6Dec 26, 2025 03:3828,852979,366,049942,110,0009,990,0002,326,528
7Dec 26, 2025 03:3828,929985,688,048944,664,0009,996,0002,416,640
8Dec 26, 2025 03:3829,018989,016,146948,584,0008,996,0002,318,336
9Dec 26, 2025 03:3829,072984,592,733949,386,0009,993,0002,326,528