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 listDec 22, 2025 17:37zielajzielajScore: 4,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 17:374,784182,949,493144,877,00012,989,0002,330,624
2Dec 22, 2025 17:374,798184,871,131147,307,00011,022,0002,306,048
3Dec 22, 2025 17:374,802183,786,580146,441,00012,036,0002,437,120
4Dec 22, 2025 17:374,805181,336,332143,608,00014,959,0002,297,856
5Dec 22, 2025 17:374,807185,801,936146,658,00011,972,0002,297,856
6Dec 22, 2025 17:374,808182,425,542143,701,00014,968,0002,486,272
7Dec 22, 2025 17:374,841182,295,093148,765,00010,982,0002,334,720
8Dec 22, 2025 17:374,843183,142,783150,837,0008,990,0002,330,624
9Dec 22, 2025 17:374,845183,678,817146,886,00012,989,0002,527,232