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 11, 2025 14:02Rajarshi BasuRajarshi BasuScore: 47,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 14:0246,9961,579,666,8001,530,879,00019,985,0002,277,376
2Dec 11, 2025 14:0247,1201,590,661,5691,537,964,00016,988,0002,318,336
3Dec 11, 2025 14:0247,3581,587,540,4291,550,812,00011,990,0002,306,048
4Dec 11, 2025 14:0247,4121,594,120,2341,551,623,00012,988,0002,342,912
5Dec 11, 2025 14:0247,4501,596,023,0321,544,881,00020,984,0002,392,064
6Dec 11, 2025 14:0247,5071,602,519,2091,546,733,00020,982,0002,383,872
7Dec 11, 2025 14:0247,5181,597,629,2631,547,091,00020,987,0002,383,872
8Dec 11, 2025 14:0247,7621,605,036,7501,557,155,00018,989,0002,482,176
9Dec 11, 2025 14:0248,5201,625,707,0051,586,167,00014,992,0002,404,352