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 05:07Rajarshi BasuRajarshi BasuScore: 5,547Success
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 05:075,479203,421,768175,823,0004,994,0002,519,040
2Dec 20, 2025 05:075,522205,180,310176,226,0006,007,0002,490,368
3Dec 20, 2025 05:075,535204,551,795178,650,0003,992,0002,457,600
4Dec 20, 2025 05:075,547207,970,583178,048,0005,001,0002,465,792
5Dec 20, 2025 05:075,555205,843,681179,297,0004,006,0002,277,376
6Dec 20, 2025 05:075,771218,152,849187,437,0002,991,0002,387,968