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 27, 2022 13:17Bernard TeoBernard TeoScore: 10,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2022 13:1710,375410,300,720342,388,87502,273,280
2Aug 27, 2022 13:1810,403415,242,925343,314,23502,277,376
3Aug 27, 2022 13:1810,460412,704,828345,181,10602,285,568
4Aug 27, 2022 13:1710,476406,013,156345,696,96202,281,472
5Aug 27, 2022 13:1810,477405,131,695345,728,20302,273,280
6Aug 27, 2022 13:1710,660412,518,876351,787,08102,277,376