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 20, 2025 08:17Rajarshi BasuRajarshi BasuScore: 5,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 08:175,257200,449,727166,462,0007,019,0002,486,272
2Dec 20, 2025 08:175,281196,424,341169,264,0005,007,0002,514,944
3Dec 20, 2025 08:175,285199,469,698170,388,0004,009,0002,527,232
4Dec 20, 2025 08:175,287206,628,868169,463,0005,013,0002,506,752
5Dec 20, 2025 08:175,293200,188,131169,688,0004,990,0002,514,944
6Dec 20, 2025 08:175,312198,465,101171,294,0004,006,0002,342,912
7Dec 20, 2025 08:175,315199,831,911170,379,0005,011,0002,514,944
8Dec 20, 2025 08:175,336210,074,094172,100,0004,002,0002,510,848
9Dec 20, 2025 08:175,352203,391,184169,633,0006,984,0002,502,656