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 listOct 14, 2025 07:15Nguyen Thanh VinhNguyen Thanh VinhScore: 351,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2025 07:15349,26411,566,155,54311,418,790,000106,932,0002,375,680
2Oct 14, 2025 07:15351,17411,628,843,31811,479,841,000108,913,0002,510,848
3Oct 14, 2025 07:15352,22511,656,526,67811,524,501,00098,935,0002,510,848