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 listFeb 28, 2025 05:23NoSIMD_C#NoSIMD_C#Score: 89,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 05:2388,6932,954,283,1942,868,917,00057,957,0002,322,432
2Feb 28, 2025 05:2389,1952,978,074,7092,886,489,00056,950,0002,306,048
3Feb 28, 2025 05:23115,4213,910,926,8173,753,149,00055,734,0002,527,232