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 listOct 11, 2022 17:28Kenneth MaplesKenneth MaplesScore: 27,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 17:3227,741988,501,296915,439,08102,301,952
2Oct 11, 2022 17:3227,818979,517,993918,005,28302,297,856
3Oct 11, 2022 17:2827,826977,242,209918,247,63302,306,048
4Oct 11, 2022 17:2827,852979,009,205919,104,73302,301,952
5Oct 11, 2022 17:2828,079999,947,500926,615,54502,297,856
6Oct 11, 2022 17:3228,123994,484,289928,064,36602,293,760