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 26, 2022 13:21Bernard TeoBernard TeoScore: 10,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2022 13:2110,459415,347,526345,137,21802,285,568
2Aug 26, 2022 13:2110,529433,699,418347,442,34602,248,704
3Aug 26, 2022 13:2110,540413,730,183347,819,48202,285,568
4Aug 26, 2022 13:2110,546419,296,929348,030,13502,273,280
5Aug 26, 2022 13:2110,558423,566,205348,399,10702,285,568
6Aug 26, 2022 13:2110,608415,980,983350,047,55902,273,280
7Aug 26, 2022 13:2110,609420,224,389350,088,93002,277,376
8Aug 26, 2022 13:2110,625411,509,082350,626,10502,281,472
9Aug 26, 2022 13:2110,657410,321,741351,691,07702,285,568