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 listFeb 16, 2023 18:55LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2023 18:5400000Error: expected "1018652 ", got "1018651 "stderr
2Feb 16, 2023 18:5584,4882,854,675,4902,788,097,33502,297,856
3Feb 16, 2023 18:5584,5812,856,394,0902,791,161,27502,301,952
4Feb 16, 2023 18:5584,8262,877,732,6422,799,247,06002,306,048
5Feb 16, 2023 18:5584,9952,874,800,3402,804,846,05802,306,048
6Feb 16, 2023 18:5585,1422,864,153,2882,809,696,02802,187,264
7Feb 16, 2023 18:5585,3242,892,758,6082,815,695,86902,314,240