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 31, 2026 01:16Andrew EpsteinAndrew EpsteinScore: 2,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 01:192,66497,093,88686,837,0001,094,0002,113,536
2Oct 31, 2026 01:192,67197,353,16586,886,0001,261,0002,113,536
3Oct 31, 2026 01:192,70098,351,01187,833,0001,284,0002,113,536
4Oct 31, 2026 01:192,707100,289,70588,313,0001,033,0002,113,536
5Oct 31, 2026 01:192,70998,521,88488,165,0001,257,0002,113,536
6Oct 31, 2026 01:192,72199,028,59988,694,0001,104,0002,113,536
7Oct 31, 2026 01:192,74499,714,92289,308,0001,267,0002,113,536
8Oct 31, 2026 01:192,749100,183,10689,475,0001,273,0002,113,536
9Oct 31, 2026 01:192,798101,536,55591,093,0001,271,0002,113,536