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 listSep 26, 2024 11:09Joad NacerJoad NacerScore: 4,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2024 11:094,842178,940,717148,801,00010,985,0002,461,696
2Sep 26, 2024 11:094,872184,966,677146,800,00013,981,0002,465,792
3Sep 26, 2024 11:094,874183,620,898146,843,00013,985,0002,289,664
4Sep 26, 2024 11:094,926184,642,273144,600,00017,950,0002,330,624
5Sep 26, 2024 11:094,936191,647,718146,890,00015,988,0002,330,624
6Sep 26, 2024 11:094,957198,017,463147,628,00015,959,0002,457,600
7Sep 26, 2024 11:094,987192,436,029147,618,00016,956,0002,457,600
8Sep 26, 2024 11:095,187194,953,567156,154,00015,014,0002,342,912
9Sep 26, 2024 11:095,215199,047,581156,095,00016,009,0002,457,600