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 4, 2026 17:20zielajzielajScore: 3,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 17:203,056126,993,06699,847,000998,0002,420,736
2Jan 4, 2026 17:203,160127,174,913102,281,0002,005,0002,273,280
3Jan 4, 2026 17:203,170131,675,471103,589,0001,005,0002,416,640
4Jan 4, 2026 17:203,201134,726,262103,618,0002,012,0002,273,280
5Jan 4, 2026 17:203,272131,186,303106,975,000999,0002,535,424
6Jan 4, 2026 17:203,349136,853,197109,518,0001,004,0002,428,928
7Jan 4, 2026 17:203,357132,727,857108,775,0001,995,0002,408,448
8Jan 4, 2026 17:203,370136,036,659109,201,0002,003,0002,416,640
9Jan 4, 2026 17:203,461143,070,233112,221,0002,003,0002,416,640