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 25, 2022 16:26Bernard 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 25, 2022 16:2100000Error: expected "1020486 ", got "1020485"
2Aug 25, 2022 16:2518,750684,993,042618,735,65902,273,280
3Aug 25, 2022 16:2618,801673,890,736620,426,45502,285,568
4Aug 25, 2022 16:2518,878702,249,994622,963,54902,273,280
5Aug 25, 2022 16:2618,942687,998,859625,091,14902,273,280
6Aug 25, 2022 16:2618,942698,977,754625,094,69702,289,664
7Aug 25, 2022 16:2519,007701,009,191627,235,28202,277,376