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 listMar 21, 2026 18:56Dominique GarmierDominique GarmierScore: 7,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 18:567,724231,728,734571,793,00010,976,0002,400,256
2Mar 21, 2026 18:567,735232,050,595574,560,0007,980,0002,404,352
3Mar 21, 2026 18:567,827234,799,950574,484,00010,008,0002,486,272
4Mar 21, 2026 18:567,843235,292,771573,465,00010,008,0002,404,352
5Mar 21, 2026 18:567,888236,654,828572,690,00011,993,0002,412,544
6Mar 21, 2026 18:567,958238,745,949571,888,00010,978,0002,363,392
7Mar 21, 2026 18:567,974239,218,455579,153,0009,985,0002,375,680
8Mar 21, 2026 18:567,999239,970,244601,100,0008,986,0002,514,944
9Mar 21, 2026 18:568,101243,042,393577,292,00010,005,0002,420,736