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 31, 2025 11:21Aniruddha DebAniruddha DebScore: 9,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 11:219,090332,631,834244,172,00055,810,0002,342,912
2Dec 31, 2025 11:219,097326,690,037261,319,00038,898,0002,498,560
3Dec 31, 2025 11:219,120334,569,882251,124,00049,826,0002,506,752
4Dec 31, 2025 11:219,134336,143,836258,491,00042,915,0002,347,008
5Dec 31, 2025 11:219,143328,159,308257,764,00043,959,0002,502,656
6Dec 31, 2025 11:219,169324,975,368260,639,00041,942,0002,342,912
7Dec 31, 2025 11:219,182334,199,860261,142,00041,862,0002,342,912
8Dec 31, 2025 11:219,190334,935,188256,397,00046,889,0002,342,912
9Dec 31, 2025 11:219,243331,064,160252,004,00053,000,0002,342,912