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 listAug 23, 2025 09:28Adam FolwarcznyAdam FolwarcznyScore: 125,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2025 09:28125,1934,157,918,9214,067,410,00063,959,0002,277,376
2Aug 23, 2025 09:28125,2594,163,750,8654,069,583,00063,962,0002,347,008
3Aug 23, 2025 09:28125,4064,168,211,0584,073,440,00064,959,0002,277,376
4Aug 23, 2025 09:28125,6504,177,098,4544,061,487,00084,947,0002,277,376
5Aug 23, 2025 09:28125,6514,184,516,3754,093,518,00052,967,0002,506,752
6Aug 23, 2025 09:28125,6764,178,635,4334,088,342,00058,961,0002,445,312
7Aug 23, 2025 09:28125,7954,178,662,5764,071,280,00079,946,0002,277,376
8Aug 23, 2025 09:28126,1514,193,303,9424,088,016,00074,963,0002,449,408
9Aug 23, 2025 09:28126,2294,199,397,8004,093,608,00071,957,0002,469,888