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 listDec 29, 2024 17:37Yuriy LyfenkoYuriy LyfenkoScore: 6,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 17:376,622198,660,043506,188,0004,001,0002,621,440
2Dec 29, 2024 17:376,634199,028,809509,268,0004,002,0002,621,440
3Dec 29, 2024 17:376,719201,581,793523,485,0001,998,0002,400,256
4Dec 29, 2024 17:376,730201,888,101509,241,0004,001,0002,453,504
5Dec 29, 2024 17:376,774203,214,469506,901,0002,999,0002,502,656
6Dec 29, 2024 17:376,826204,778,248520,842,0003,004,0002,621,440
7Dec 29, 2024 17:376,857205,697,396511,735,0002,002,0002,768,896
8Dec 29, 2024 17:376,882206,447,165519,413,0004,984,0002,605,056
9Dec 29, 2024 17:376,943208,281,226520,138,0003,000,0002,617,344