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 11, 2026 13:18Victor MerckléVictor MerckléScore: 6,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 13:196,574224,565,793178,908,00038,055,0002,113,536
2Jun 11, 2026 13:196,577224,503,083178,878,00038,170,0002,113,536
3Jun 11, 2026 13:196,583226,355,219179,661,00037,606,0002,113,536
4Jun 11, 2026 13:196,587224,840,556179,146,00038,229,0002,113,536
5Jun 11, 2026 13:196,590224,893,165179,292,00038,191,0002,113,536
6Jun 11, 2026 13:196,608225,623,403179,756,00038,329,0002,113,536
7Jun 11, 2026 13:196,617225,878,097179,761,00038,624,0002,113,536
8Jun 11, 2026 13:196,621226,028,944180,127,00038,392,0002,113,536
9Jun 11, 2026 13:196,654227,214,525181,326,00038,258,0002,113,536