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 listSep 26, 2025 11:41Wookyung JeongWookyung JeongScore: 109,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 11:41108,9153,623,493,1213,458,296,000135,893,0002,457,600
2Sep 26, 2025 11:41109,3943,637,969,4873,459,131,000150,874,0002,445,312
3Sep 26, 2025 11:41111,2543,696,816,0693,526,497,000144,897,0002,445,312