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 28, 2022 06:52Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 06:5200000Error: expected "1021995 ", got "1021994"
2Aug 28, 2022 06:5210,527409,488,550347,400,52402,281,472
3Aug 28, 2022 06:5210,640415,856,084351,129,70302,285,568
4Aug 28, 2022 06:5210,732418,095,476354,161,27602,281,472
5Aug 28, 2022 06:5210,862445,549,044358,440,28102,281,472
6Aug 28, 2022 06:5211,044425,956,666364,452,61902,277,376
7Aug 28, 2022 06:5211,058420,697,000364,898,10902,285,568