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 listSep 7, 2021 19:58piculpiculScore: 29,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 19:5829,1561,028,679,708962,159,87102,306,048
2Sep 7, 2021 20:1929,1761,039,463,516962,801,22602,187,264
3Sep 7, 2021 20:1929,2451,033,673,799965,094,43902,187,264
4Sep 7, 2021 19:5829,2581,037,894,279965,530,06402,179,072
5Sep 7, 2021 19:5829,4241,038,490,833970,981,27702,179,072
6Sep 7, 2021 20:1929,4261,030,116,615971,067,93502,191,360