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 9, 2026 01:58zielajzielajScore: 3,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 01:583,031123,889,56998,033,0002,000,0002,535,424
2Jan 9, 2026 01:583,064125,780,57598,109,0003,003,0002,297,856
3Jan 9, 2026 01:583,085125,983,109100,816,000998,0002,535,424
4Jan 9, 2026 01:583,115127,040,438100,807,0001,996,0002,412,544
5Jan 9, 2026 01:583,124126,098,822102,093,0001,000,0002,301,952
6Jan 9, 2026 01:583,144124,805,07999,760,0003,990,0002,416,640
7Jan 9, 2026 01:583,154124,587,310101,081,0003,002,0002,420,736
8Jan 9, 2026 01:583,154123,833,268102,097,0002,001,0002,412,544
9Jan 9, 2026 01:583,230135,286,704105,578,0001,005,0002,420,736