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 6, 2025 10:26NoSIMD_C#NoSIMD_C#Score: 87,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:2686,6482,885,190,3802,812,420,00046,973,0002,547,712
2Feb 6, 2025 10:2686,8992,899,795,5422,825,686,00041,980,0002,543,616
3Feb 6, 2025 10:2687,1112,901,084,6852,819,688,00054,974,0002,428,928
4Feb 6, 2025 10:2687,2042,914,147,3822,829,764,00047,979,0002,453,504
5Feb 6, 2025 10:2687,4802,917,280,8432,843,872,00042,967,0002,547,712
6Feb 6, 2025 10:2688,9412,964,658,0702,884,094,00050,966,0002,301,952
7Feb 6, 2025 10:2689,7852,995,785,8702,909,956,00052,962,0002,531,328
8Feb 6, 2025 10:26109,1793,735,135,0843,555,110,00047,799,0002,453,504
9Feb 6, 2025 10:26129,9024,320,638,9114,241,801,00044,976,0002,437,120