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 listApr 4, 2025 18:35NoSIMD_C#NoSIMD_C#Score: 88,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 18:3586,4602,878,724,5192,807,209,00045,970,0002,506,752
2Apr 4, 2025 18:3586,5672,884,230,0722,811,719,00044,979,0002,523,136
3Apr 4, 2025 18:3587,6482,931,695,1292,844,438,00047,956,0002,306,048
4Apr 4, 2025 18:3587,9122,926,382,9442,840,140,00060,960,0002,543,616
5Apr 4, 2025 18:3588,6752,952,108,0072,879,289,00046,972,0002,543,616
6Apr 4, 2025 18:3588,8602,958,735,3362,882,416,00049,972,0002,547,712
7Apr 4, 2025 18:3589,0512,967,682,5772,896,702,00041,966,0002,330,624
8Apr 4, 2025 18:3589,4142,976,476,8462,889,674,00060,972,0002,514,944
9Apr 4, 2025 18:3589,5162,987,046,7352,915,066,00038,974,0002,502,656