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 listDec 4, 2024 14:28NoSIMD_C#NoSIMD_C#Score: 198,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 14:28195,2296,471,806,9946,355,625,00086,940,0002,514,944
2Dec 4, 2024 14:28196,4976,515,552,0606,403,444,00080,942,0002,482,176
3Dec 4, 2024 14:28196,9266,531,170,8696,408,608,00089,938,0002,445,312
4Dec 4, 2024 14:28197,8056,557,430,5656,440,628,00086,940,0002,351,104
5Dec 4, 2024 14:28198,2046,573,125,3086,465,797,00074,951,0002,342,912
6Dec 4, 2024 14:28199,1606,605,029,4296,490,346,00081,941,0002,351,104
7Dec 4, 2024 14:28199,4936,616,048,9526,503,317,00079,942,0002,342,912
8Dec 4, 2024 14:28199,5646,624,607,9456,481,716,000103,899,0002,412,544
9Dec 4, 2024 14:28215,5167,205,874,5407,013,280,00098,764,0002,297,856