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 8, 2026 19:09Josu San MartinJosu San MartinScore: 10,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:099,964355,998,573320,801,0007,995,0002,494,464
2Jan 8, 2026 19:099,964353,968,014320,829,0007,995,0002,367,488
3Jan 8, 2026 19:099,973355,404,995322,103,0007,002,0002,461,696
4Jan 8, 2026 19:099,974359,997,173323,137,0006,002,0002,510,848
5Jan 8, 2026 19:0910,004358,244,850324,132,0006,002,0002,490,368
6Jan 8, 2026 19:0910,029360,351,626323,969,0006,999,0002,367,488
7Jan 8, 2026 19:0910,047357,947,299324,557,0006,990,0002,510,848
8Jan 8, 2026 19:0910,101359,141,091327,347,0005,988,0002,359,296
9Jan 8, 2026 19:0910,115368,549,131327,810,0005,996,0002,363,392