Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 3, 2025 05:30NoSIMD_C#NoSIMD_C#Score: 530,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:30529,97615,899,286,12815,754,848,000111,927,0002,613,248
2Feb 3, 2025 05:30530,27815,908,334,41715,768,512,000110,933,0002,662,400
3Feb 3, 2025 05:30530,73215,921,965,49815,767,457,000119,919,0002,592,768