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:17Bernard TeoBernard TeoError
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:1700000Error: expected "1024914 ", got "1024913"
2Aug 26, 2022 13:1700000Error: expected "1025095 ", got "1025094"
3Aug 26, 2022 13:2200000Error: expected "1025160 ", got "1025159"
4Aug 26, 2022 13:1710,390413,633,185342,865,85202,285,568
5Aug 26, 2022 13:1710,496410,074,976346,365,65502,277,376
6Aug 26, 2022 13:1710,539421,465,468347,776,95002,277,376