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 listJun 7, 2026 20:34anboto1anboto1Score: 13,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 20:3513,438453,253,550430,559,00012,924,0002,117,632
2Jun 7, 2026 20:3513,445453,057,437431,070,00012,641,0002,117,632
3Jun 7, 2026 20:3513,458453,950,448431,501,00012,639,0002,117,632
4Jun 7, 2026 20:3513,493455,546,819432,345,00012,949,0002,117,632
5Jun 7, 2026 20:3513,523456,004,038433,209,00013,073,0002,117,632
6Jun 7, 2026 20:3513,547456,423,971434,307,00012,752,0002,117,632
7Jun 7, 2026 20:3513,611458,477,534436,772,00012,405,0002,117,632
8Jun 7, 2026 20:3513,629459,104,906436,940,00012,843,0002,117,632
9Jun 7, 2026 20:3513,731462,996,442439,637,00013,491,0002,117,632