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:35Adam FolwarcznyAdam FolwarcznyScore: 124,822Success
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:35124,1164,120,875,1434,030,853,00064,965,0002,314,240
2Aug 23, 2025 09:35124,1494,129,623,6324,036,945,00059,969,0002,269,184
3Aug 23, 2025 09:35124,5674,141,768,7564,048,757,00061,965,0002,273,280
4Aug 23, 2025 09:35124,6304,142,839,0614,054,813,00057,968,0002,273,280
5Aug 23, 2025 09:35124,8224,148,932,9424,050,183,00068,952,0002,289,664
6Aug 23, 2025 09:35125,1634,157,139,4824,087,405,00042,972,0002,273,280
7Aug 23, 2025 09:35125,2854,166,450,9444,060,466,00073,953,0002,310,144
8Aug 23, 2025 09:35125,3414,167,785,7974,059,314,00076,949,0002,306,048
9Aug 23, 2025 09:35125,5454,165,370,4924,074,025,00068,966,0002,314,240