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 5, 2026 18:18Павел РатмановПавел РатмановScore: 111,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 08:5379,5472,654,529,1442,607,072,00017,986,0002,289,664
2Jan 6, 2026 08:5379,6642,659,105,0862,611,915,00016,992,0002,445,312
3Jan 6, 2026 08:5387,2072,903,057,1972,862,837,00014,988,0002,285,568
4Jan 5, 2026 18:18111,4103,701,954,5673,658,532,00017,982,000266,240
5Jan 5, 2026 18:18114,3343,801,169,5393,754,043,00018,969,0002,285,568
6Jan 5, 2026 18:18123,2534,100,080,8684,051,369,00015,981,000290,816