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 listNov 20, 2024 15:51NoSIMD_C#NoSIMD_C#Score: 321,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 15:51320,03610,602,178,93710,429,275,000131,902,0002,338,816
2Nov 20, 2024 15:51321,31710,635,534,66310,480,534,000122,912,0002,424,832
3Nov 20, 2024 15:51328,55610,873,657,93010,727,443,000114,908,0002,400,256