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:34NoSIMD_C#NoSIMD_C#Score: 362,707Success
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:34354,99011,752,456,69411,559,800,000154,876,0002,379,776
2Nov 20, 2024 15:34362,70712,007,853,14011,824,451,000144,883,0002,519,040
3Nov 20, 2024 15:34366,27312,123,752,44011,964,075,000122,928,0002,519,040