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 listJan 1, 2026 22:42zielajzielajScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 22:423,477136,182,164107,758,0006,984,0002,342,912
2Jan 1, 2026 22:423,492137,854,471109,223,0006,012,0002,342,912
3Jan 1, 2026 22:423,506146,401,168107,711,0007,978,0002,428,928
4Jan 1, 2026 22:423,514139,098,190108,965,0006,997,0002,482,176
5Jan 1, 2026 22:423,522135,523,754108,197,0008,014,0002,347,008
6Jan 1, 2026 22:423,526136,625,825110,342,0006,018,0002,342,912