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 10, 2026 06:38Josu San MartinJosu San MartinScore: 5,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 06:385,362200,621,469173,942,0002,999,0002,383,872
2Jan 10, 2026 06:385,370199,775,215172,189,0005,005,0002,338,816
3Jan 10, 2026 06:385,372205,596,343174,280,0003,004,0002,347,008
4Jan 10, 2026 06:385,384204,561,638172,675,0004,990,0002,273,280
5Jan 10, 2026 06:385,386203,755,653173,758,0003,994,0002,482,176
6Jan 10, 2026 06:385,411204,984,476173,557,0005,016,0002,363,392
7Jan 10, 2026 06:385,447202,345,925174,743,0004,992,0002,379,776
8Jan 10, 2026 06:385,453202,572,836175,940,0003,998,0002,412,544
9Jan 10, 2026 06:385,471211,677,968177,545,0002,992,0002,392,064