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 12, 2026 23:21Adam FolwarcznyAdam FolwarcznyScore: 19,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 23:2119,764678,492,516645,212,0007,002,0002,273,280
2Jan 12, 2026 23:2119,774676,954,347643,558,0008,993,0002,359,296
3Jan 12, 2026 23:2119,810685,266,212644,750,0008,996,0002,363,392
4Jan 12, 2026 23:2119,833681,889,309643,493,00010,991,0002,486,272
5Jan 12, 2026 23:2119,838680,036,028643,670,00010,994,0002,359,296
6Jan 12, 2026 23:2119,842686,118,576645,784,0008,997,0002,359,296
7Jan 12, 2026 23:2119,896684,021,089650,577,0005,996,0002,351,104
8Jan 12, 2026 23:2119,960682,656,840651,688,0006,996,0002,359,296
9Jan 12, 2026 23:2119,975687,006,376650,181,0009,002,0002,457,600