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 listJun 7, 2024 19:02GraceGraceScore: 538,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 19:02534,66617,716,107,49017,643,974,97802,232,320
2Jun 7, 2024 19:02535,73117,745,250,32417,679,125,27802,318,336
3Jun 7, 2024 19:02536,05017,767,728,71917,689,639,62602,236,416
4Jun 7, 2024 19:02538,72817,843,666,22517,778,011,65102,367,488
5Jun 7, 2024 19:02539,31917,858,240,55717,797,514,58402,281,472
6Jun 7, 2024 19:02539,39317,854,946,92617,799,954,18702,400,256