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 listMay 22, 2021 19:38Yuriy LyfenkoYuriy LyfenkoScore: 20,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 19:3820,024723,224,117660,781,01602,244,608
2May 22, 2021 19:3820,255727,834,299668,430,88602,252,800
3May 22, 2021 19:3820,347737,503,501671,461,30902,256,896
4May 22, 2021 19:3820,417729,833,129673,772,35302,252,800
5May 22, 2021 19:3820,436728,026,083674,371,56002,248,704
6May 22, 2021 19:3821,153761,628,525698,064,74002,248,704