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 listMay 14, 2026 23:18Josu San MartinJosu San MartinScore: 3,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:193,658130,056,150119,675,0001,059,0002,113,536
2May 14, 2026 23:193,660131,337,814119,746,0001,060,0002,113,536
3May 14, 2026 23:193,669131,351,788120,041,0001,041,0002,113,536
4May 14, 2026 23:193,669129,839,183120,048,0001,054,0002,113,536
5May 14, 2026 23:193,675130,391,655120,248,0001,034,0002,113,536
6May 14, 2026 23:193,675131,724,395120,230,0001,047,0002,113,536
7May 14, 2026 23:193,678132,735,549120,348,0001,039,0002,113,536
8May 14, 2026 23:193,686131,184,811120,596,0001,054,0002,113,536
9May 14, 2026 23:193,688130,793,862120,673,0001,057,0002,113,536