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 29, 2022 10:26Bernard TeoBernard TeoScore: 11,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2022 10:2611,477446,456,744378,747,54102,297,856
2Aug 29, 2022 10:2611,491444,275,294379,190,39302,179,072
3Aug 29, 2022 10:2611,553439,301,706381,261,03502,306,048
4Aug 29, 2022 10:2611,576443,616,647382,018,62102,301,952
5Aug 29, 2022 10:2611,612461,280,601383,202,46002,174,976
6Aug 29, 2022 10:2611,620462,446,694383,449,84402,297,856