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 15, 2026 22:31Adam FolwarcznyAdam FolwarcznyScore: 11,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:3111,741415,210,120372,476,00014,978,0002,371,584
2Jan 15, 2026 22:3111,797417,042,637373,290,00016,012,0002,535,424
3Jan 15, 2026 22:3111,805409,440,812372,600,00016,981,0002,441,216
4Jan 15, 2026 22:3111,806413,338,786371,608,00017,981,0002,498,560
5Jan 15, 2026 22:3111,822415,476,786377,109,00013,003,0002,531,328
6Jan 15, 2026 22:3111,838410,262,324370,676,00019,982,0002,412,544
7Jan 15, 2026 22:3111,877413,927,423374,938,00016,997,0002,371,584
8Jan 15, 2026 22:3111,980421,556,339381,342,00014,012,0002,379,776
9Jan 15, 2026 22:3112,199422,860,233386,598,00015,983,0002,371,584