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 listJan 19, 2025 00:53Ian MckibbenIan MckibbenScore: 30,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 00:5330,760922,791,964811,585,00091,953,0002,715,648
2Jan 19, 2025 00:5330,886926,577,310802,658,000101,956,0002,662,400
3Jan 19, 2025 00:5330,933927,989,455818,714,00086,969,0002,703,360
4Jan 19, 2025 00:5330,939928,169,291821,162,00078,919,0002,527,232
5Jan 19, 2025 00:5330,993929,791,463829,293,00078,932,0002,519,040
6Jan 19, 2025 00:5331,035931,046,611821,335,00083,932,0002,527,232
7Jan 19, 2025 00:5331,055931,660,051815,511,00088,946,0002,625,536
8Jan 19, 2025 00:5331,082932,465,971811,830,00091,980,0002,580,480
9Jan 19, 2025 00:5331,254937,633,401808,803,00096,976,0002,691,072