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 listNov 20, 2025 23:44izotoffizotoffScore: 54,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 23:4453,8721,810,601,3671,753,808,00023,983,0002,330,624
2Nov 20, 2025 23:4453,9411,804,904,8301,760,078,00019,989,0002,330,624
3Nov 20, 2025 23:4453,9551,813,798,8721,759,537,00020,994,0002,330,624
4Nov 20, 2025 23:4454,0711,815,433,1431,766,353,00017,993,0002,408,448
5Nov 20, 2025 23:4454,0731,812,463,5041,766,428,00017,994,0002,330,624
6Nov 20, 2025 23:4454,1291,813,651,3711,768,254,00017,992,0002,306,048
7Nov 20, 2025 23:4454,1621,815,665,6941,768,354,00018,993,0002,330,624
8Nov 20, 2025 23:4456,4911,897,680,2291,846,224,00017,992,0002,510,848
9Nov 20, 2025 23:4456,5471,893,956,4681,850,036,00016,000,0002,392,064