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 7, 2024 19:09GraceGraceScore: 533,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 19:09530,30917,573,544,37217,500,211,18202,240,512
2Jun 7, 2024 19:09532,83717,649,062,27817,583,621,21002,215,936
3Jun 7, 2024 19:09533,31117,659,636,67317,599,262,55902,207,744
4Jun 7, 2024 19:09533,45817,659,473,01117,604,124,72902,195,456
5Jun 7, 2024 19:09536,20617,769,111,92417,694,790,22102,252,800
6Jun 7, 2024 19:09541,51317,945,649,36617,869,924,78502,224,128