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 listApr 23, 2026 07:39olliecrowolliecrowScore: 14,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 07:4014,801505,564,080479,428,0009,008,0002,519,040
2Apr 23, 2026 07:4014,810504,193,754479,759,0008,995,0002,375,680
3Apr 23, 2026 07:4014,865507,891,600480,572,0009,991,0002,326,528
4Apr 23, 2026 07:4014,879505,694,125481,028,00010,000,0002,539,520
5Apr 23, 2026 07:4014,935507,546,136483,884,0008,997,0002,543,616
6Apr 23, 2026 07:4014,979512,729,435485,327,0009,006,0002,547,712
7Apr 23, 2026 07:4014,987512,435,244484,584,0009,991,0002,527,232
8Apr 23, 2026 07:4015,003506,902,245485,119,00010,002,0002,330,624
9Apr 23, 2026 07:4015,047520,482,554485,588,00010,990,0002,543,616