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 27, 2026 21:23Victor MerckléVictor MerckléScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 21:243,379119,410,214110,279,0001,240,0002,113,536
2Jun 27, 2026 21:243,380119,276,795110,325,0001,244,0002,113,536
3Jun 27, 2026 21:243,382119,669,132110,373,0001,259,0002,113,536
4Jun 27, 2026 21:243,390121,433,102110,627,0001,271,0002,113,536
5Jun 27, 2026 21:243,392119,727,289110,710,0001,242,0002,113,536
6Jun 27, 2026 21:243,393119,702,323110,772,0001,207,0002,113,536
7Jun 27, 2026 21:243,404120,266,275111,066,0001,272,0002,113,536
8Jun 27, 2026 21:243,405125,450,040111,073,0001,317,0002,113,536
9Jun 27, 2026 21:243,414120,534,445111,421,0001,272,0002,113,536