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:31NoSIMD_C#NoSIMD_C#Score: 356,273Success
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:31354,30511,736,972,03111,536,179,000155,894,0002,433,024
2Nov 20, 2024 15:31356,27311,793,745,05611,581,158,000175,850,0002,408,448
3Nov 20, 2024 15:31364,06912,046,753,68511,864,406,000149,878,0002,428,928