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 listJun 9, 2021 00:23Yuriy LyfenkoYuriy LyfenkoScore: 11,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2021 00:2811,447433,756,968377,739,09102,252,800
2Jun 9, 2021 00:2311,470440,692,248378,514,41002,248,704
3Jun 9, 2021 00:2811,512441,300,603379,894,88502,265,088
4Jun 9, 2021 00:2311,520453,248,497380,166,04702,277,376
5Jun 9, 2021 00:2311,528448,712,723380,428,44902,256,896
6Jun 9, 2021 00:2811,537444,788,565380,734,73502,256,896