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 listDec 20, 2025 09:11Rajarshi BasuRajarshi BasuScore: 5,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 09:115,200194,671,129167,604,0003,990,0002,510,848
2Dec 20, 2025 09:115,212193,812,530163,991,0007,999,0002,367,488
3Dec 20, 2025 09:115,217198,865,747167,162,0005,004,0002,519,040
4Dec 20, 2025 09:115,223191,833,728167,335,0005,010,0002,523,136
5Dec 20, 2025 09:115,229198,148,645169,571,0002,992,0002,514,944
6Dec 20, 2025 09:115,230199,475,007166,594,0005,985,0002,506,752
7Dec 20, 2025 09:115,238201,348,835165,871,0006,994,0002,523,136
8Dec 20, 2025 09:115,242198,319,717166,991,0005,999,0002,285,568
9Dec 20, 2025 09:115,369203,941,968171,183,0006,006,0002,433,024