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 21, 2022 16:17Bernard TeoBernard TeoScore: 17,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2022 16:1817,804665,494,214587,525,36202,244,608
2Aug 21, 2022 16:1717,864658,181,881589,514,63602,248,704
3Aug 21, 2022 16:1717,920665,301,791591,370,72602,248,704
4Aug 21, 2022 16:1817,921661,255,634591,385,81202,244,608
5Aug 21, 2022 16:1817,946658,671,685592,209,94502,240,512
6Aug 21, 2022 16:1718,041674,825,955595,343,07902,240,512