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 25, 2022 15:41Bernard TeoBernard TeoScore: 14,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2022 15:4814,390553,038,669474,875,30002,248,704
2Aug 25, 2022 15:4114,405539,113,407475,353,37902,281,472
3Aug 25, 2022 15:4114,443530,200,870476,606,26902,281,472
4Aug 25, 2022 15:4814,463536,198,109477,290,09502,281,472
5Aug 25, 2022 15:4814,525539,466,350479,319,48902,285,568
6Aug 25, 2022 15:4114,586533,808,656481,328,63802,252,800