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 listJun 22, 2025 06:05Ian MckibbenIan MckibbenScore: 16,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:0516,708572,425,084459,466,00091,893,0002,449,408
2Jun 22, 2025 06:0516,718573,088,194458,742,00092,947,0002,531,328
3Jun 22, 2025 06:0516,739579,977,416465,479,00086,902,0002,539,520
4Jun 22, 2025 06:0516,797579,922,331480,387,00073,905,0002,285,568
5Jun 22, 2025 06:0516,804577,766,219478,587,00075,934,0002,494,464
6Jun 22, 2025 06:0516,841588,471,956474,786,00080,963,0002,527,232
7Jun 22, 2025 06:0516,874582,913,950472,877,00083,978,0002,277,376
8Jun 22, 2025 06:0516,927585,457,998467,648,00090,931,0002,281,472
9Jun 22, 2025 06:0517,009591,081,306476,395,00084,892,0002,424,832